TPTP Problem File: ITP068^2.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : ITP068^2 : TPTP v8.2.0. Released v7.5.0.
% Domain : Interactive Theorem Proving
% Problem : Sledgehammer HeapImperative problem prob_383__5342344_1
% Version : Especial.
% English :
% Refs : [BH+15] Blanchette et al. (2015), Mining the Archive of Formal
% : [Des21] Desharnais (2021), Email to Geoff Sutcliffe
% Source : [Des21]
% Names : HeapImperative/prob_383__5342344_1 [Des21]
% Status : Theorem
% Rating : 0.33 v8.1.0, 0.50 v7.5.0
% Syntax : Number of formulae : 351 ( 89 unt; 74 typ; 0 def)
% Number of atoms : 871 ( 295 equ; 0 cnn)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 5675 ( 97 ~; 11 |; 70 &;5006 @)
% ( 0 <=>; 491 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 10 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 419 ( 419 >; 0 *; 0 +; 0 <<)
% Number of symbols : 76 ( 73 usr; 13 con; 0-8 aty)
% Number of variables : 1469 ( 65 ^;1307 !; 21 ?;1469 :)
% ( 76 !>; 0 ?*; 0 @-; 0 @+)
% SPC : TH1_THM_EQU_NAR
% Comments : This file was generated by Sledgehammer 2021-02-23 16:15:51.638
%------------------------------------------------------------------------------
% Could-be-implicit typings (6)
thf(ty_t_Product__Type_Oprod,type,
product_prod: $tType > $tType > $tType ).
thf(ty_t_Multiset_Omultiset,type,
multiset: $tType > $tType ).
thf(ty_t_List_Olist,type,
list: $tType > $tType ).
thf(ty_t_Heap_OTree,type,
tree: $tType > $tType ).
thf(ty_t_Set_Oset,type,
set: $tType > $tType ).
thf(ty_tf_a,type,
a: $tType ).
% Explicit typings (68)
thf(sy_cl_HOL_Otype,type,
type:
!>[A: $tType] : $o ).
thf(sy_cl_Orderings_Oord,type,
ord:
!>[A: $tType] : $o ).
thf(sy_cl_Orderings_Oorder,type,
order:
!>[A: $tType] : $o ).
thf(sy_cl_Orderings_Olinorder,type,
linorder:
!>[A: $tType] : $o ).
thf(sy_cl_Orderings_Opreorder,type,
preorder:
!>[A: $tType] : $o ).
thf(sy_cl_Groups_Ocancel__comm__monoid__add,type,
cancel1352612707id_add:
!>[A: $tType] : $o ).
thf(sy_cl_Groups_Olinordered__ab__group__add,type,
linord219039673up_add:
!>[A: $tType] : $o ).
thf(sy_cl_Groups_Oordered__comm__monoid__add,type,
ordere216010020id_add:
!>[A: $tType] : $o ).
thf(sy_cl_Groups_Oordered__ab__semigroup__add,type,
ordere779506340up_add:
!>[A: $tType] : $o ).
thf(sy_cl_Rings_Olinordered__nonzero__semiring,type,
linord1659791738miring:
!>[A: $tType] : $o ).
thf(sy_cl_Groups_Ocanonically__ordered__monoid__add,type,
canoni770627133id_add:
!>[A: $tType] : $o ).
thf(sy_cl_Groups_Oordered__ab__semigroup__add__imp__le,type,
ordere236663937imp_le:
!>[A: $tType] : $o ).
thf(sy_cl_Divides_Ounique__euclidean__semiring__numeral,type,
unique1598680935umeral:
!>[A: $tType] : $o ).
thf(sy_cl_Groups_Oordered__ab__semigroup__monoid__add__imp__le,type,
ordere516151231imp_le:
!>[A: $tType] : $o ).
thf(sy_c_BNF__Cardinal__Order__Relation_OrelChain,type,
bNF_Ca1785829860lChain:
!>[A: $tType,B: $tType] : ( ( set @ ( product_prod @ A @ A ) ) > ( A > B ) > $o ) ).
thf(sy_c_Divides_Ounique__euclidean__semiring__numeral__class_Odivides__aux,type,
unique455577585es_aux:
!>[A: $tType] : ( ( product_prod @ A @ A ) > $o ) ).
thf(sy_c_Groups_Oplus__class_Oplus,type,
plus_plus:
!>[A: $tType] : ( A > A > A ) ).
thf(sy_c_Groups_Ozero__class_Ozero,type,
zero_zero:
!>[A: $tType] : A ).
thf(sy_c_HOL_ONO__MATCH,type,
nO_MATCH:
!>[A: $tType,B: $tType] : ( A > B > $o ) ).
thf(sy_c_HeapImperative__Mirabelle__oitemzccmr_Oleft,type,
heapIm1271749598e_left:
!>[A: $tType] : ( ( tree @ A ) > ( tree @ A ) ) ).
thf(sy_c_HeapImperative__Mirabelle__oitemzccmr_Oright,type,
heapIm1434396069_right:
!>[A: $tType] : ( ( tree @ A ) > ( tree @ A ) ) ).
thf(sy_c_HeapImperative__Mirabelle__oitemzccmr_OsiftDown,type,
heapIm748920189ftDown:
!>[A: $tType] : ( ( tree @ A ) > ( tree @ A ) ) ).
thf(sy_c_Heap_OHeap,type,
heap:
!>[B: $tType,A: $tType] : ( B > ( B > $o ) > ( ( list @ A ) > B ) > ( B > ( multiset @ A ) ) > ( B > ( tree @ A ) ) > ( B > ( product_prod @ A @ B ) ) > $o ) ).
thf(sy_c_Heap_OHeap__axioms,type,
heap_axioms:
!>[B: $tType,A: $tType] : ( ( B > $o ) > ( ( list @ A ) > B ) > ( B > ( multiset @ A ) ) > ( B > ( tree @ A ) ) > ( B > ( product_prod @ A @ B ) ) > $o ) ).
thf(sy_c_Heap_OTree_OE,type,
e:
!>[A: $tType] : ( tree @ A ) ).
thf(sy_c_Heap_OTree_OT,type,
t:
!>[A: $tType] : ( A > ( tree @ A ) > ( tree @ A ) > ( tree @ A ) ) ).
thf(sy_c_Heap_OTree_Ocase__Tree,type,
case_Tree:
!>[B: $tType,A: $tType] : ( B > ( A > ( tree @ A ) > ( tree @ A ) > B ) > ( tree @ A ) > B ) ).
thf(sy_c_Heap_OTree_Orec__Tree,type,
rec_Tree:
!>[C: $tType,A: $tType] : ( C > ( A > ( tree @ A ) > ( tree @ A ) > C > C > C ) > ( tree @ A ) > C ) ).
thf(sy_c_Heap_OTree_Orel__Tree,type,
rel_Tree:
!>[A: $tType,B: $tType] : ( ( A > B > $o ) > ( tree @ A ) > ( tree @ B ) > $o ) ).
thf(sy_c_Heap_Oin__tree,type,
in_tree:
!>[A: $tType] : ( A > ( tree @ A ) > $o ) ).
thf(sy_c_Heap_Ois__heap,type,
is_heap:
!>[A: $tType] : ( ( tree @ A ) > $o ) ).
thf(sy_c_Heap_Omultiset,type,
multiset2:
!>[A: $tType] : ( ( tree @ A ) > ( multiset @ A ) ) ).
thf(sy_c_Heap_Oval,type,
val:
!>[A: $tType] : ( ( tree @ A ) > A ) ).
thf(sy_c_Lattices__Big_Olinorder__class_OMax,type,
lattic929149872er_Max:
!>[A: $tType] : ( ( set @ A ) > A ) ).
thf(sy_c_Multiset_Oadd__mset,type,
add_mset:
!>[A: $tType] : ( A > ( multiset @ A ) > ( multiset @ A ) ) ).
thf(sy_c_Multiset_Ocomm__monoid__add_Osum__mset,type,
comm_monoid_sum_mset:
!>[A: $tType] : ( ( A > A > A ) > A > ( multiset @ A ) > A ) ).
thf(sy_c_Multiset_Ofold__mset,type,
fold_mset:
!>[A: $tType,B: $tType] : ( ( A > B > B ) > B > ( multiset @ A ) > B ) ).
thf(sy_c_Multiset_Oimage__mset,type,
image_mset:
!>[A: $tType,B: $tType] : ( ( A > B ) > ( multiset @ A ) > ( multiset @ B ) ) ).
thf(sy_c_Multiset_Omult,type,
mult:
!>[A: $tType] : ( ( set @ ( product_prod @ A @ A ) ) > ( set @ ( product_prod @ ( multiset @ A ) @ ( multiset @ A ) ) ) ) ).
thf(sy_c_Multiset_Omult1,type,
mult1:
!>[A: $tType] : ( ( set @ ( product_prod @ A @ A ) ) > ( set @ ( product_prod @ ( multiset @ A ) @ ( multiset @ A ) ) ) ) ).
thf(sy_c_Multiset_Omultp,type,
multp:
!>[A: $tType] : ( ( A > A > $o ) > ( multiset @ A ) > ( multiset @ A ) > $o ) ).
thf(sy_c_Multiset_Oset__mset,type,
set_mset:
!>[A: $tType] : ( ( multiset @ A ) > ( set @ A ) ) ).
thf(sy_c_Multiset_Osubseteq__mset,type,
subseteq_mset:
!>[A: $tType] : ( ( multiset @ A ) > ( multiset @ A ) > $o ) ).
thf(sy_c_Orderings_Oord__class_Oless__eq,type,
ord_less_eq:
!>[A: $tType] : ( A > A > $o ) ).
thf(sy_c_Orderings_Oorder_Oantimono,type,
antimono:
!>[A: $tType,B: $tType] : ( ( A > A > $o ) > ( A > B ) > $o ) ).
thf(sy_c_Orderings_Oorder__class_OGreatest,type,
order_Greatest:
!>[A: $tType] : ( ( A > $o ) > A ) ).
thf(sy_c_Product__Type_OPair,type,
product_Pair:
!>[A: $tType,B: $tType] : ( A > B > ( product_prod @ A @ B ) ) ).
thf(sy_c_Product__Type_Ointernal__case__prod,type,
produc2004651681e_prod:
!>[A: $tType,B: $tType,C: $tType] : ( ( A > B > C ) > ( product_prod @ A @ B ) > C ) ).
thf(sy_c_Product__Type_Oold_Oprod_Orec__prod,type,
product_rec_prod:
!>[A: $tType,B: $tType,T: $tType] : ( ( A > B > T ) > ( product_prod @ A @ B ) > T ) ).
thf(sy_c_Relation_Oirrefl,type,
irrefl:
!>[A: $tType] : ( ( set @ ( product_prod @ A @ A ) ) > $o ) ).
thf(sy_c_Relation_Otrans,type,
trans:
!>[A: $tType] : ( ( set @ ( product_prod @ A @ A ) ) > $o ) ).
thf(sy_c_RemoveMax_OCollection,type,
collection:
!>[B: $tType,A: $tType] : ( B > ( B > $o ) > ( ( list @ A ) > B ) > ( B > ( multiset @ A ) ) > $o ) ).
thf(sy_c_RemoveMax_OCollection_Oset,type,
set2:
!>[B: $tType,A: $tType] : ( ( B > ( multiset @ A ) ) > B > ( set @ A ) ) ).
thf(sy_c_RemoveMax_ORemoveMax,type,
removeMax:
!>[B: $tType,A: $tType] : ( B > ( B > $o ) > ( ( list @ A ) > B ) > ( B > ( multiset @ A ) ) > ( B > ( product_prod @ A @ B ) ) > ( B > $o ) > $o ) ).
thf(sy_c_RemoveMax_ORemoveMax__axioms,type,
removeMax_axioms:
!>[B: $tType,A: $tType] : ( ( B > $o ) > ( ( list @ A ) > B ) > ( B > ( multiset @ A ) ) > ( B > ( product_prod @ A @ B ) ) > ( B > $o ) > $o ) ).
thf(sy_c_Set_OCollect,type,
collect:
!>[A: $tType] : ( ( A > $o ) > ( set @ A ) ) ).
thf(sy_c_member,type,
member:
!>[A: $tType] : ( A > ( set @ A ) > $o ) ).
thf(sy_v_l,type,
l: tree @ a ).
thf(sy_v_l1____,type,
l1: tree @ a ).
thf(sy_v_la____,type,
la: tree @ a ).
thf(sy_v_r,type,
r: tree @ a ).
thf(sy_v_r1____,type,
r1: tree @ a ).
thf(sy_v_ra____,type,
ra: tree @ a ).
thf(sy_v_t,type,
t2: tree @ a ).
thf(sy_v_v,type,
v: a ).
thf(sy_v_v1____,type,
v1: a ).
thf(sy_v_v2____,type,
v2: a ).
thf(sy_v_va____,type,
va: a ).
% Relevant facts (256)
thf(fact_0__C4_Oprems_C_I2_J,axiom,
is_heap @ a @ ra ).
% "4.prems"(2)
thf(fact_1__C4_Oprems_C_I1_J,axiom,
is_heap @ a @ la ).
% "4.prems"(1)
thf(fact_2_assms_I2_J,axiom,
is_heap @ a @ r ).
% assms(2)
thf(fact_3_assms_I1_J,axiom,
is_heap @ a @ l ).
% assms(1)
thf(fact_4_True,axiom,
ord_less_eq @ a @ v1 @ v2 ).
% True
thf(fact_5__C4_Oprems_C_I3_J,axiom,
( ( t @ a @ v2 @ ( e @ a ) @ ( t @ a @ v1 @ l1 @ r1 ) )
= ( t @ a @ va @ la @ ra ) ) ).
% "4.prems"(3)
thf(fact_6_siftDown_Osimps_I2_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [V: A] :
( ( heapIm748920189ftDown @ A @ ( t @ A @ V @ ( e @ A ) @ ( e @ A ) ) )
= ( t @ A @ V @ ( e @ A ) @ ( e @ A ) ) ) ) ).
% siftDown.simps(2)
thf(fact_7_siftDown_Osimps_I1_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ( ( heapIm748920189ftDown @ A @ ( e @ A ) )
= ( e @ A ) ) ) ).
% siftDown.simps(1)
thf(fact_8_siftDown_Ocases,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [X: tree @ A] :
( ( X
!= ( e @ A ) )
=> ( ! [V2: A] :
( X
!= ( t @ A @ V2 @ ( e @ A ) @ ( e @ A ) ) )
=> ( ! [V2: A,Va: A,Vb: tree @ A,Vc: tree @ A] :
( X
!= ( t @ A @ V2 @ ( t @ A @ Va @ Vb @ Vc ) @ ( e @ A ) ) )
=> ( ! [V2: A,Va: A,Vb: tree @ A,Vc: tree @ A] :
( X
!= ( t @ A @ V2 @ ( e @ A ) @ ( t @ A @ Va @ Vb @ Vc ) ) )
=> ~ ! [V2: A,Va: A,Vb: tree @ A,Vc: tree @ A,Vd: A,Ve: tree @ A,Vf: tree @ A] :
( X
!= ( t @ A @ V2 @ ( t @ A @ Va @ Vb @ Vc ) @ ( t @ A @ Vd @ Ve @ Vf ) ) ) ) ) ) ) ) ).
% siftDown.cases
thf(fact_9_assms_I3_J,axiom,
( t2
= ( t @ a @ v @ l @ r ) ) ).
% assms(3)
thf(fact_10_is__heap_Osimps_I2_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [V: A] : ( is_heap @ A @ ( t @ A @ V @ ( e @ A ) @ ( e @ A ) ) ) ) ).
% is_heap.simps(2)
thf(fact_11_siftDown__Node,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [T2: tree @ A,V: A,L: tree @ A,R: tree @ A] :
( ( T2
= ( t @ A @ V @ L @ R ) )
=> ? [L2: tree @ A,V3: A,R2: tree @ A] :
( ( ( heapIm748920189ftDown @ A @ T2 )
= ( t @ A @ V3 @ L2 @ R2 ) )
& ( ord_less_eq @ A @ V @ V3 ) ) ) ) ).
% siftDown_Node
thf(fact_12__C4_Ohyps_C,axiom,
! [L: tree @ a,R: tree @ a,V: a] :
( ~ ( ord_less_eq @ a @ ( val @ a @ ( t @ a @ v1 @ l1 @ r1 ) ) @ v2 )
=> ( ( is_heap @ a @ L )
=> ( ( is_heap @ a @ R )
=> ( ( ( t @ a @ v2 @ ( heapIm1271749598e_left @ a @ ( t @ a @ v1 @ l1 @ r1 ) ) @ ( heapIm1434396069_right @ a @ ( t @ a @ v1 @ l1 @ r1 ) ) )
= ( t @ a @ V @ L @ R ) )
=> ( is_heap @ a @ ( heapIm748920189ftDown @ a @ ( t @ a @ v2 @ ( heapIm1271749598e_left @ a @ ( t @ a @ v1 @ l1 @ r1 ) ) @ ( heapIm1434396069_right @ a @ ( t @ a @ v1 @ l1 @ r1 ) ) ) ) ) ) ) ) ) ).
% "4.hyps"
thf(fact_13_Tree_Oinject,axiom,
! [A: $tType,X21: A,X22: tree @ A,X23: tree @ A,Y21: A,Y22: tree @ A,Y23: tree @ A] :
( ( ( t @ A @ X21 @ X22 @ X23 )
= ( t @ A @ Y21 @ Y22 @ Y23 ) )
= ( ( X21 = Y21 )
& ( X22 = Y22 )
& ( X23 = Y23 ) ) ) ).
% Tree.inject
thf(fact_14_is__heap_Osimps_I1_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ( is_heap @ A @ ( e @ A ) ) ) ).
% is_heap.simps(1)
thf(fact_15_Tree_Odistinct_I1_J,axiom,
! [A: $tType,X21: A,X22: tree @ A,X23: tree @ A] :
( ( e @ A )
!= ( t @ A @ X21 @ X22 @ X23 ) ) ).
% Tree.distinct(1)
thf(fact_16_Tree_Oinduct,axiom,
! [A: $tType,P: ( tree @ A ) > $o,Tree: tree @ A] :
( ( P @ ( e @ A ) )
=> ( ! [X1: A,X2: tree @ A,X3: tree @ A] :
( ( P @ X2 )
=> ( ( P @ X3 )
=> ( P @ ( t @ A @ X1 @ X2 @ X3 ) ) ) )
=> ( P @ Tree ) ) ) ).
% Tree.induct
thf(fact_17_Tree_Oexhaust,axiom,
! [A: $tType,Y: tree @ A] :
( ( Y
!= ( e @ A ) )
=> ~ ! [X212: A,X222: tree @ A,X232: tree @ A] :
( Y
!= ( t @ A @ X212 @ X222 @ X232 ) ) ) ).
% Tree.exhaust
thf(fact_18_is__heap_Ocases,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [X: tree @ A] :
( ( X
!= ( e @ A ) )
=> ( ! [V2: A] :
( X
!= ( t @ A @ V2 @ ( e @ A ) @ ( e @ A ) ) )
=> ( ! [V2: A,Va: A,Vb: tree @ A,Vc: tree @ A] :
( X
!= ( t @ A @ V2 @ ( e @ A ) @ ( t @ A @ Va @ Vb @ Vc ) ) )
=> ( ! [V2: A,Va: A,Vb: tree @ A,Vc: tree @ A] :
( X
!= ( t @ A @ V2 @ ( t @ A @ Va @ Vb @ Vc ) @ ( e @ A ) ) )
=> ~ ! [V2: A,Va: A,Vb: tree @ A,Vc: tree @ A,Vd: A,Ve: tree @ A,Vf: tree @ A] :
( X
!= ( t @ A @ V2 @ ( t @ A @ Va @ Vb @ Vc ) @ ( t @ A @ Vd @ Ve @ Vf ) ) ) ) ) ) ) ) ).
% is_heap.cases
thf(fact_19_siftDown__in__tree__set,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ( ( in_tree @ A )
= ( ^ [V4: A,T3: tree @ A] : ( in_tree @ A @ V4 @ ( heapIm748920189ftDown @ A @ T3 ) ) ) ) ) ).
% siftDown_in_tree_set
thf(fact_20_left_Osimps,axiom,
! [A: $tType,V: A,L: tree @ A,R: tree @ A] :
( ( heapIm1271749598e_left @ A @ ( t @ A @ V @ L @ R ) )
= L ) ).
% left.simps
thf(fact_21_is__heap__max,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [V: A,T2: tree @ A] :
( ( in_tree @ A @ V @ T2 )
=> ( ( is_heap @ A @ T2 )
=> ( ord_less_eq @ A @ V @ ( val @ A @ T2 ) ) ) ) ) ).
% is_heap_max
thf(fact_22_val_Osimps,axiom,
! [A: $tType,V: A,Uu: tree @ A,Uv: tree @ A] :
( ( val @ A @ ( t @ A @ V @ Uu @ Uv ) )
= V ) ).
% val.simps
thf(fact_23_in__tree_Osimps_I2_J,axiom,
! [A: $tType,V: A,V5: A,L: tree @ A,R: tree @ A] :
( ( in_tree @ A @ V @ ( t @ A @ V5 @ L @ R ) )
= ( ( V = V5 )
| ( in_tree @ A @ V @ L )
| ( in_tree @ A @ V @ R ) ) ) ).
% in_tree.simps(2)
thf(fact_24_siftDown_Osimps_I5_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [Vd2: A,Ve2: tree @ A,Vf2: tree @ A,Va2: A,Vb2: tree @ A,Vc2: tree @ A,V: A] :
( ( ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) @ ( val @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) )
=> ( ( ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ V )
=> ( ( heapIm748920189ftDown @ A @ ( t @ A @ V @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) )
= ( t @ A @ V @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) ) )
& ( ~ ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ V )
=> ( ( heapIm748920189ftDown @ A @ ( t @ A @ V @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) )
= ( t @ A @ ( val @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ ( heapIm748920189ftDown @ A @ ( t @ A @ V @ ( heapIm1271749598e_left @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ ( heapIm1434396069_right @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) ) ) @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) ) ) ) )
& ( ~ ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) @ ( val @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) )
=> ( ( ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) @ V )
=> ( ( heapIm748920189ftDown @ A @ ( t @ A @ V @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) )
= ( t @ A @ V @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) ) )
& ( ~ ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) @ V )
=> ( ( heapIm748920189ftDown @ A @ ( t @ A @ V @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) )
= ( t @ A @ ( val @ A @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) @ ( heapIm748920189ftDown @ A @ ( t @ A @ V @ ( heapIm1271749598e_left @ A @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) @ ( heapIm1434396069_right @ A @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) ) ) ) ) ) ) ) ) ) ).
% siftDown.simps(5)
thf(fact_25_siftDown_Osimps_I6_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [Va2: A,Vb2: tree @ A,Vc2: tree @ A,Vd2: A,Ve2: tree @ A,Vf2: tree @ A,V: A] :
( ( ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ ( val @ A @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) )
=> ( ( ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) @ V )
=> ( ( heapIm748920189ftDown @ A @ ( t @ A @ V @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) )
= ( t @ A @ V @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) ) )
& ( ~ ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) @ V )
=> ( ( heapIm748920189ftDown @ A @ ( t @ A @ V @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) )
= ( t @ A @ ( val @ A @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) @ ( heapIm748920189ftDown @ A @ ( t @ A @ V @ ( heapIm1271749598e_left @ A @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) @ ( heapIm1434396069_right @ A @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) ) ) @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) ) ) ) )
& ( ~ ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ ( val @ A @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) )
=> ( ( ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ V )
=> ( ( heapIm748920189ftDown @ A @ ( t @ A @ V @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) )
= ( t @ A @ V @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) ) )
& ( ~ ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ V )
=> ( ( heapIm748920189ftDown @ A @ ( t @ A @ V @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) )
= ( t @ A @ ( val @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) @ ( heapIm748920189ftDown @ A @ ( t @ A @ V @ ( heapIm1271749598e_left @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ ( heapIm1434396069_right @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) ) ) ) ) ) ) ) ) ) ).
% siftDown.simps(6)
thf(fact_26_in__tree_Osimps_I1_J,axiom,
! [A: $tType,V: A] :
~ ( in_tree @ A @ V @ ( e @ A ) ) ).
% in_tree.simps(1)
thf(fact_27_is__heap_Osimps_I5_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [V: A,Va2: A,Vb2: tree @ A,Vc2: tree @ A,Vd2: A,Ve2: tree @ A,Vf2: tree @ A] :
( ( is_heap @ A @ ( t @ A @ V @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) )
= ( ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) @ V )
& ( is_heap @ A @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) )
& ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ V )
& ( is_heap @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) ) ) ) ).
% is_heap.simps(5)
thf(fact_28_is__heap_Osimps_I6_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [V: A,Vd2: A,Ve2: tree @ A,Vf2: tree @ A,Va2: A,Vb2: tree @ A,Vc2: tree @ A] :
( ( is_heap @ A @ ( t @ A @ V @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) )
= ( ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ V )
& ( is_heap @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) )
& ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) @ V )
& ( is_heap @ A @ ( t @ A @ Vd2 @ Ve2 @ Vf2 ) ) ) ) ) ).
% is_heap.simps(6)
thf(fact_29_siftDown_Osimps_I3_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [Va2: A,Vb2: tree @ A,Vc2: tree @ A,V: A] :
( ( ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ V )
=> ( ( heapIm748920189ftDown @ A @ ( t @ A @ V @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) @ ( e @ A ) ) )
= ( t @ A @ V @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) @ ( e @ A ) ) ) )
& ( ~ ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ V )
=> ( ( heapIm748920189ftDown @ A @ ( t @ A @ V @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) @ ( e @ A ) ) )
= ( t @ A @ ( val @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ ( heapIm748920189ftDown @ A @ ( t @ A @ V @ ( heapIm1271749598e_left @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ ( heapIm1434396069_right @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) ) ) @ ( e @ A ) ) ) ) ) ) ).
% siftDown.simps(3)
thf(fact_30_siftDown_Osimps_I4_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [Va2: A,Vb2: tree @ A,Vc2: tree @ A,V: A] :
( ( ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ V )
=> ( ( heapIm748920189ftDown @ A @ ( t @ A @ V @ ( e @ A ) @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) )
= ( t @ A @ V @ ( e @ A ) @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) ) )
& ( ~ ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ V )
=> ( ( heapIm748920189ftDown @ A @ ( t @ A @ V @ ( e @ A ) @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) )
= ( t @ A @ ( val @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ ( e @ A ) @ ( heapIm748920189ftDown @ A @ ( t @ A @ V @ ( heapIm1271749598e_left @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ ( heapIm1434396069_right @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) ) ) ) ) ) ) ) ).
% siftDown.simps(4)
thf(fact_31_siftDown__in__tree,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [T2: tree @ A] :
( ( T2
!= ( e @ A ) )
=> ( in_tree @ A @ ( val @ A @ ( heapIm748920189ftDown @ A @ T2 ) ) @ T2 ) ) ) ).
% siftDown_in_tree
thf(fact_32_is__heap_Osimps_I3_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [V: A,Va2: A,Vb2: tree @ A,Vc2: tree @ A] :
( ( is_heap @ A @ ( t @ A @ V @ ( e @ A ) @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) )
= ( ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ V )
& ( is_heap @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) ) ) ) ).
% is_heap.simps(3)
thf(fact_33_is__heap_Osimps_I4_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [V: A,Va2: A,Vb2: tree @ A,Vc2: tree @ A] :
( ( is_heap @ A @ ( t @ A @ V @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) @ ( e @ A ) ) )
= ( ( ord_less_eq @ A @ ( val @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) @ V )
& ( is_heap @ A @ ( t @ A @ Va2 @ Vb2 @ Vc2 ) ) ) ) ) ).
% is_heap.simps(4)
thf(fact_34_right_Osimps,axiom,
! [A: $tType,V: A,L: tree @ A,R: tree @ A] :
( ( heapIm1434396069_right @ A @ ( t @ A @ V @ L @ R ) )
= R ) ).
% right.simps
thf(fact_35_order__refl,axiom,
! [A: $tType] :
( ( preorder @ A )
=> ! [X: A] : ( ord_less_eq @ A @ X @ X ) ) ).
% order_refl
thf(fact_36_le__funD,axiom,
! [B: $tType,A: $tType] :
( ( ord @ B )
=> ! [F: A > B,G: A > B,X: A] :
( ( ord_less_eq @ ( A > B ) @ F @ G )
=> ( ord_less_eq @ B @ ( F @ X ) @ ( G @ X ) ) ) ) ).
% le_funD
thf(fact_37_le__funE,axiom,
! [B: $tType,A: $tType] :
( ( ord @ B )
=> ! [F: A > B,G: A > B,X: A] :
( ( ord_less_eq @ ( A > B ) @ F @ G )
=> ( ord_less_eq @ B @ ( F @ X ) @ ( G @ X ) ) ) ) ).
% le_funE
thf(fact_38_le__funI,axiom,
! [B: $tType,A: $tType] :
( ( ord @ B )
=> ! [F: A > B,G: A > B] :
( ! [X4: A] : ( ord_less_eq @ B @ ( F @ X4 ) @ ( G @ X4 ) )
=> ( ord_less_eq @ ( A > B ) @ F @ G ) ) ) ).
% le_funI
thf(fact_39_le__fun__def,axiom,
! [B: $tType,A: $tType] :
( ( ord @ B )
=> ( ( ord_less_eq @ ( A > B ) )
= ( ^ [F2: A > B,G2: A > B] :
! [X5: A] : ( ord_less_eq @ B @ ( F2 @ X5 ) @ ( G2 @ X5 ) ) ) ) ) ).
% le_fun_def
thf(fact_40_order__subst1,axiom,
! [A: $tType,B: $tType] :
( ( ( order @ B )
& ( order @ A ) )
=> ! [A2: A,F: B > A,B2: B,C2: B] :
( ( ord_less_eq @ A @ A2 @ ( F @ B2 ) )
=> ( ( ord_less_eq @ B @ B2 @ C2 )
=> ( ! [X4: B,Y2: B] :
( ( ord_less_eq @ B @ X4 @ Y2 )
=> ( ord_less_eq @ A @ ( F @ X4 ) @ ( F @ Y2 ) ) )
=> ( ord_less_eq @ A @ A2 @ ( F @ C2 ) ) ) ) ) ) ).
% order_subst1
thf(fact_41_order__subst2,axiom,
! [A: $tType,C: $tType] :
( ( ( order @ C )
& ( order @ A ) )
=> ! [A2: A,B2: A,F: A > C,C2: C] :
( ( ord_less_eq @ A @ A2 @ B2 )
=> ( ( ord_less_eq @ C @ ( F @ B2 ) @ C2 )
=> ( ! [X4: A,Y2: A] :
( ( ord_less_eq @ A @ X4 @ Y2 )
=> ( ord_less_eq @ C @ ( F @ X4 ) @ ( F @ Y2 ) ) )
=> ( ord_less_eq @ C @ ( F @ A2 ) @ C2 ) ) ) ) ) ).
% order_subst2
thf(fact_42_verit__la__disequality,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [A2: A,B2: A] :
( ( A2 = B2 )
| ~ ( ord_less_eq @ A @ A2 @ B2 )
| ~ ( ord_less_eq @ A @ B2 @ A2 ) ) ) ).
% verit_la_disequality
thf(fact_43_ord__eq__le__subst,axiom,
! [A: $tType,B: $tType] :
( ( ( ord @ B )
& ( ord @ A ) )
=> ! [A2: A,F: B > A,B2: B,C2: B] :
( ( A2
= ( F @ B2 ) )
=> ( ( ord_less_eq @ B @ B2 @ C2 )
=> ( ! [X4: B,Y2: B] :
( ( ord_less_eq @ B @ X4 @ Y2 )
=> ( ord_less_eq @ A @ ( F @ X4 ) @ ( F @ Y2 ) ) )
=> ( ord_less_eq @ A @ A2 @ ( F @ C2 ) ) ) ) ) ) ).
% ord_eq_le_subst
thf(fact_44_ord__le__eq__subst,axiom,
! [A: $tType,B: $tType] :
( ( ( ord @ B )
& ( ord @ A ) )
=> ! [A2: A,B2: A,F: A > B,C2: B] :
( ( ord_less_eq @ A @ A2 @ B2 )
=> ( ( ( F @ B2 )
= C2 )
=> ( ! [X4: A,Y2: A] :
( ( ord_less_eq @ A @ X4 @ Y2 )
=> ( ord_less_eq @ B @ ( F @ X4 ) @ ( F @ Y2 ) ) )
=> ( ord_less_eq @ B @ ( F @ A2 ) @ C2 ) ) ) ) ) ).
% ord_le_eq_subst
thf(fact_45_mem__Collect__eq,axiom,
! [A: $tType,A2: A,P: A > $o] :
( ( member @ A @ A2 @ ( collect @ A @ P ) )
= ( P @ A2 ) ) ).
% mem_Collect_eq
thf(fact_46_Collect__mem__eq,axiom,
! [A: $tType,A3: set @ A] :
( ( collect @ A
@ ^ [X5: A] : ( member @ A @ X5 @ A3 ) )
= A3 ) ).
% Collect_mem_eq
thf(fact_47_Collect__cong,axiom,
! [A: $tType,P: A > $o,Q: A > $o] :
( ! [X4: A] :
( ( P @ X4 )
= ( Q @ X4 ) )
=> ( ( collect @ A @ P )
= ( collect @ A @ Q ) ) ) ).
% Collect_cong
thf(fact_48_ext,axiom,
! [B: $tType,A: $tType,F: A > B,G: A > B] :
( ! [X4: A] :
( ( F @ X4 )
= ( G @ X4 ) )
=> ( F = G ) ) ).
% ext
thf(fact_49_dual__order_Oantisym,axiom,
! [A: $tType] :
( ( order @ A )
=> ! [B2: A,A2: A] :
( ( ord_less_eq @ A @ B2 @ A2 )
=> ( ( ord_less_eq @ A @ A2 @ B2 )
=> ( A2 = B2 ) ) ) ) ).
% dual_order.antisym
thf(fact_50_dual__order_Oeq__iff,axiom,
! [A: $tType] :
( ( order @ A )
=> ( ( ^ [Y3: A,Z: A] : Y3 = Z )
= ( ^ [A4: A,B3: A] :
( ( ord_less_eq @ A @ B3 @ A4 )
& ( ord_less_eq @ A @ A4 @ B3 ) ) ) ) ) ).
% dual_order.eq_iff
thf(fact_51_dual__order_Otrans,axiom,
! [A: $tType] :
( ( order @ A )
=> ! [B2: A,A2: A,C2: A] :
( ( ord_less_eq @ A @ B2 @ A2 )
=> ( ( ord_less_eq @ A @ C2 @ B2 )
=> ( ord_less_eq @ A @ C2 @ A2 ) ) ) ) ).
% dual_order.trans
thf(fact_52_linorder__wlog,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [P: A > A > $o,A2: A,B2: A] :
( ! [A5: A,B4: A] :
( ( ord_less_eq @ A @ A5 @ B4 )
=> ( P @ A5 @ B4 ) )
=> ( ! [A5: A,B4: A] :
( ( P @ B4 @ A5 )
=> ( P @ A5 @ B4 ) )
=> ( P @ A2 @ B2 ) ) ) ) ).
% linorder_wlog
thf(fact_53_dual__order_Orefl,axiom,
! [A: $tType] :
( ( order @ A )
=> ! [A2: A] : ( ord_less_eq @ A @ A2 @ A2 ) ) ).
% dual_order.refl
thf(fact_54_order__trans,axiom,
! [A: $tType] :
( ( preorder @ A )
=> ! [X: A,Y: A,Z2: A] :
( ( ord_less_eq @ A @ X @ Y )
=> ( ( ord_less_eq @ A @ Y @ Z2 )
=> ( ord_less_eq @ A @ X @ Z2 ) ) ) ) ).
% order_trans
thf(fact_55_order__class_Oorder_Oantisym,axiom,
! [A: $tType] :
( ( order @ A )
=> ! [A2: A,B2: A] :
( ( ord_less_eq @ A @ A2 @ B2 )
=> ( ( ord_less_eq @ A @ B2 @ A2 )
=> ( A2 = B2 ) ) ) ) ).
% order_class.order.antisym
thf(fact_56_ord__le__eq__trans,axiom,
! [A: $tType] :
( ( ord @ A )
=> ! [A2: A,B2: A,C2: A] :
( ( ord_less_eq @ A @ A2 @ B2 )
=> ( ( B2 = C2 )
=> ( ord_less_eq @ A @ A2 @ C2 ) ) ) ) ).
% ord_le_eq_trans
thf(fact_57_ord__eq__le__trans,axiom,
! [A: $tType] :
( ( ord @ A )
=> ! [A2: A,B2: A,C2: A] :
( ( A2 = B2 )
=> ( ( ord_less_eq @ A @ B2 @ C2 )
=> ( ord_less_eq @ A @ A2 @ C2 ) ) ) ) ).
% ord_eq_le_trans
thf(fact_58_order__class_Oorder_Oeq__iff,axiom,
! [A: $tType] :
( ( order @ A )
=> ( ( ^ [Y3: A,Z: A] : Y3 = Z )
= ( ^ [A4: A,B3: A] :
( ( ord_less_eq @ A @ A4 @ B3 )
& ( ord_less_eq @ A @ B3 @ A4 ) ) ) ) ) ).
% order_class.order.eq_iff
thf(fact_59_antisym__conv,axiom,
! [A: $tType] :
( ( order @ A )
=> ! [Y: A,X: A] :
( ( ord_less_eq @ A @ Y @ X )
=> ( ( ord_less_eq @ A @ X @ Y )
= ( X = Y ) ) ) ) ).
% antisym_conv
thf(fact_60_le__cases3,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [X: A,Y: A,Z2: A] :
( ( ( ord_less_eq @ A @ X @ Y )
=> ~ ( ord_less_eq @ A @ Y @ Z2 ) )
=> ( ( ( ord_less_eq @ A @ Y @ X )
=> ~ ( ord_less_eq @ A @ X @ Z2 ) )
=> ( ( ( ord_less_eq @ A @ X @ Z2 )
=> ~ ( ord_less_eq @ A @ Z2 @ Y ) )
=> ( ( ( ord_less_eq @ A @ Z2 @ Y )
=> ~ ( ord_less_eq @ A @ Y @ X ) )
=> ( ( ( ord_less_eq @ A @ Y @ Z2 )
=> ~ ( ord_less_eq @ A @ Z2 @ X ) )
=> ~ ( ( ord_less_eq @ A @ Z2 @ X )
=> ~ ( ord_less_eq @ A @ X @ Y ) ) ) ) ) ) ) ) ).
% le_cases3
thf(fact_61_order_Otrans,axiom,
! [A: $tType] :
( ( order @ A )
=> ! [A2: A,B2: A,C2: A] :
( ( ord_less_eq @ A @ A2 @ B2 )
=> ( ( ord_less_eq @ A @ B2 @ C2 )
=> ( ord_less_eq @ A @ A2 @ C2 ) ) ) ) ).
% order.trans
thf(fact_62_le__cases,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [X: A,Y: A] :
( ~ ( ord_less_eq @ A @ X @ Y )
=> ( ord_less_eq @ A @ Y @ X ) ) ) ).
% le_cases
thf(fact_63_eq__refl,axiom,
! [A: $tType] :
( ( preorder @ A )
=> ! [X: A,Y: A] :
( ( X = Y )
=> ( ord_less_eq @ A @ X @ Y ) ) ) ).
% eq_refl
thf(fact_64_linear,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [X: A,Y: A] :
( ( ord_less_eq @ A @ X @ Y )
| ( ord_less_eq @ A @ Y @ X ) ) ) ).
% linear
thf(fact_65_antisym,axiom,
! [A: $tType] :
( ( order @ A )
=> ! [X: A,Y: A] :
( ( ord_less_eq @ A @ X @ Y )
=> ( ( ord_less_eq @ A @ Y @ X )
=> ( X = Y ) ) ) ) ).
% antisym
thf(fact_66_eq__iff,axiom,
! [A: $tType] :
( ( order @ A )
=> ( ( ^ [Y3: A,Z: A] : Y3 = Z )
= ( ^ [X5: A,Y4: A] :
( ( ord_less_eq @ A @ X5 @ Y4 )
& ( ord_less_eq @ A @ Y4 @ X5 ) ) ) ) ) ).
% eq_iff
thf(fact_67_Greatest__equality,axiom,
! [A: $tType] :
( ( order @ A )
=> ! [P: A > $o,X: A] :
( ( P @ X )
=> ( ! [Y2: A] :
( ( P @ Y2 )
=> ( ord_less_eq @ A @ Y2 @ X ) )
=> ( ( order_Greatest @ A @ P )
= X ) ) ) ) ).
% Greatest_equality
thf(fact_68_GreatestI2__order,axiom,
! [A: $tType] :
( ( order @ A )
=> ! [P: A > $o,X: A,Q: A > $o] :
( ( P @ X )
=> ( ! [Y2: A] :
( ( P @ Y2 )
=> ( ord_less_eq @ A @ Y2 @ X ) )
=> ( ! [X4: A] :
( ( P @ X4 )
=> ( ! [Y5: A] :
( ( P @ Y5 )
=> ( ord_less_eq @ A @ Y5 @ X4 ) )
=> ( Q @ X4 ) ) )
=> ( Q @ ( order_Greatest @ A @ P ) ) ) ) ) ) ).
% GreatestI2_order
thf(fact_69_le__rel__bool__arg__iff,axiom,
! [A: $tType] :
( ( ord @ A )
=> ( ( ord_less_eq @ ( $o > A ) )
= ( ^ [X6: $o > A,Y6: $o > A] :
( ( ord_less_eq @ A @ ( X6 @ $false ) @ ( Y6 @ $false ) )
& ( ord_less_eq @ A @ ( X6 @ $true ) @ ( Y6 @ $true ) ) ) ) ) ) ).
% le_rel_bool_arg_iff
thf(fact_70_Tree_Osimps_I4_J,axiom,
! [A: $tType,B: $tType,F1: B,F22: A > ( tree @ A ) > ( tree @ A ) > B] :
( ( case_Tree @ B @ A @ F1 @ F22 @ ( e @ A ) )
= F1 ) ).
% Tree.simps(4)
thf(fact_71_Tree_Osimps_I5_J,axiom,
! [B: $tType,A: $tType,F1: B,F22: A > ( tree @ A ) > ( tree @ A ) > B,X21: A,X22: tree @ A,X23: tree @ A] :
( ( case_Tree @ B @ A @ F1 @ F22 @ ( t @ A @ X21 @ X22 @ X23 ) )
= ( F22 @ X21 @ X22 @ X23 ) ) ).
% Tree.simps(5)
thf(fact_72_Tree_Osimps_I6_J,axiom,
! [A: $tType,C: $tType,F1: C,F22: A > ( tree @ A ) > ( tree @ A ) > C > C > C] :
( ( rec_Tree @ C @ A @ F1 @ F22 @ ( e @ A ) )
= F1 ) ).
% Tree.simps(6)
thf(fact_73_Heap_Ois__heap__of__list,axiom,
! [B: $tType,A: $tType] :
( ( linorder @ A )
=> ! [Empty: B,Is_empty: B > $o,Of_list: ( list @ A ) > B,Multiset: B > ( multiset @ A ),As_tree: B > ( tree @ A ),Remove_max: B > ( product_prod @ A @ B ),I: list @ A] :
( ( heap @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset @ As_tree @ Remove_max )
=> ( is_heap @ A @ ( As_tree @ ( Of_list @ I ) ) ) ) ) ).
% Heap.is_heap_of_list
thf(fact_74_Tree_Osimps_I7_J,axiom,
! [C: $tType,A: $tType,F1: C,F22: A > ( tree @ A ) > ( tree @ A ) > C > C > C,X21: A,X22: tree @ A,X23: tree @ A] :
( ( rec_Tree @ C @ A @ F1 @ F22 @ ( t @ A @ X21 @ X22 @ X23 ) )
= ( F22 @ X21 @ X22 @ X23 @ ( rec_Tree @ C @ A @ F1 @ F22 @ X22 ) @ ( rec_Tree @ C @ A @ F1 @ F22 @ X23 ) ) ) ).
% Tree.simps(7)
thf(fact_75_Heap_Oas__tree__empty,axiom,
! [A: $tType,B: $tType] :
( ( linorder @ A )
=> ! [Empty: B,Is_empty: B > $o,Of_list: ( list @ A ) > B,Multiset: B > ( multiset @ A ),As_tree: B > ( tree @ A ),Remove_max: B > ( product_prod @ A @ B ),T2: B] :
( ( heap @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset @ As_tree @ Remove_max )
=> ( ( ( As_tree @ T2 )
= ( e @ A ) )
= ( Is_empty @ T2 ) ) ) ) ).
% Heap.as_tree_empty
thf(fact_76_Heap_Oaxioms_I2_J,axiom,
! [A: $tType,B: $tType] :
( ( linorder @ A )
=> ! [Empty: B,Is_empty: B > $o,Of_list: ( list @ A ) > B,Multiset: B > ( multiset @ A ),As_tree: B > ( tree @ A ),Remove_max: B > ( product_prod @ A @ B )] :
( ( heap @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset @ As_tree @ Remove_max )
=> ( heap_axioms @ B @ A @ Is_empty @ Of_list @ Multiset @ As_tree @ Remove_max ) ) ) ).
% Heap.axioms(2)
thf(fact_77_Heap_Omultiset,axiom,
! [A: $tType,B: $tType] :
( ( linorder @ A )
=> ! [Empty: B,Is_empty: B > $o,Of_list: ( list @ A ) > B,Multiset: B > ( multiset @ A ),As_tree: B > ( tree @ A ),Remove_max: B > ( product_prod @ A @ B ),L: B] :
( ( heap @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset @ As_tree @ Remove_max )
=> ( ( Multiset @ L )
= ( multiset2 @ A @ ( As_tree @ L ) ) ) ) ) ).
% Heap.multiset
thf(fact_78_Heap_Oremove__max__val,axiom,
! [A: $tType,B: $tType] :
( ( linorder @ A )
=> ! [Empty: B,Is_empty: B > $o,Of_list: ( list @ A ) > B,Multiset: B > ( multiset @ A ),As_tree: B > ( tree @ A ),Remove_max: B > ( product_prod @ A @ B ),T2: B,M: A,T4: B] :
( ( heap @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset @ As_tree @ Remove_max )
=> ( ~ ( Is_empty @ T2 )
=> ( ( ( product_Pair @ A @ B @ M @ T4 )
= ( Remove_max @ T2 ) )
=> ( M
= ( val @ A @ ( As_tree @ T2 ) ) ) ) ) ) ) ).
% Heap.remove_max_val
thf(fact_79_Heap_Oremove__max__is__heap,axiom,
! [A: $tType,B: $tType] :
( ( linorder @ A )
=> ! [Empty: B,Is_empty: B > $o,Of_list: ( list @ A ) > B,Multiset: B > ( multiset @ A ),As_tree: B > ( tree @ A ),Remove_max: B > ( product_prod @ A @ B ),L: B,M: A,L3: B] :
( ( heap @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset @ As_tree @ Remove_max )
=> ( ~ ( Is_empty @ L )
=> ( ( is_heap @ A @ ( As_tree @ L ) )
=> ( ( ( product_Pair @ A @ B @ M @ L3 )
= ( Remove_max @ L ) )
=> ( is_heap @ A @ ( As_tree @ L3 ) ) ) ) ) ) ) ).
% Heap.remove_max_is_heap
thf(fact_80_Heap_Oaxioms_I1_J,axiom,
! [A: $tType,B: $tType] :
( ( linorder @ A )
=> ! [Empty: B,Is_empty: B > $o,Of_list: ( list @ A ) > B,Multiset: B > ( multiset @ A ),As_tree: B > ( tree @ A ),Remove_max: B > ( product_prod @ A @ B )] :
( ( heap @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset @ As_tree @ Remove_max )
=> ( collection @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset ) ) ) ).
% Heap.axioms(1)
thf(fact_81_Tree_Orel__induct,axiom,
! [A: $tType,B: $tType,R3: A > B > $o,X: tree @ A,Y: tree @ B,Q: ( tree @ A ) > ( tree @ B ) > $o] :
( ( rel_Tree @ A @ B @ R3 @ X @ Y )
=> ( ( Q @ ( e @ A ) @ ( e @ B ) )
=> ( ! [A21: A,A22: tree @ A,A23: tree @ A,B21: B,B22: tree @ B,B23: tree @ B] :
( ( R3 @ A21 @ B21 )
=> ( ( Q @ A22 @ B22 )
=> ( ( Q @ A23 @ B23 )
=> ( Q @ ( t @ A @ A21 @ A22 @ A23 ) @ ( t @ B @ B21 @ B22 @ B23 ) ) ) ) )
=> ( Q @ X @ Y ) ) ) ) ).
% Tree.rel_induct
thf(fact_82_Tree_Orel__mono,axiom,
! [B: $tType,A: $tType,R3: A > B > $o,Ra: A > B > $o] :
( ( ord_less_eq @ ( A > B > $o ) @ R3 @ Ra )
=> ( ord_less_eq @ ( ( tree @ A ) > ( tree @ B ) > $o ) @ ( rel_Tree @ A @ B @ R3 ) @ ( rel_Tree @ A @ B @ Ra ) ) ) ).
% Tree.rel_mono
thf(fact_83_Tree_Orel__eq,axiom,
! [A: $tType] :
( ( rel_Tree @ A @ A
@ ^ [Y3: A,Z: A] : Y3 = Z )
= ( ^ [Y3: tree @ A,Z: tree @ A] : Y3 = Z ) ) ).
% Tree.rel_eq
thf(fact_84_Tree_Orel__refl,axiom,
! [B: $tType,Ra: B > B > $o,X: tree @ B] :
( ! [X4: B] : ( Ra @ X4 @ X4 )
=> ( rel_Tree @ B @ B @ Ra @ X @ X ) ) ).
% Tree.rel_refl
thf(fact_85_Tree_Orel__inject_I2_J,axiom,
! [A: $tType,B: $tType,R3: A > B > $o,X21: A,X22: tree @ A,X23: tree @ A,Y21: B,Y22: tree @ B,Y23: tree @ B] :
( ( rel_Tree @ A @ B @ R3 @ ( t @ A @ X21 @ X22 @ X23 ) @ ( t @ B @ Y21 @ Y22 @ Y23 ) )
= ( ( R3 @ X21 @ Y21 )
& ( rel_Tree @ A @ B @ R3 @ X22 @ Y22 )
& ( rel_Tree @ A @ B @ R3 @ X23 @ Y23 ) ) ) ).
% Tree.rel_inject(2)
thf(fact_86_Tree_Orel__intros_I2_J,axiom,
! [A: $tType,B: $tType,R3: A > B > $o,X21: A,Y21: B,X22: tree @ A,Y22: tree @ B,X23: tree @ A,Y23: tree @ B] :
( ( R3 @ X21 @ Y21 )
=> ( ( rel_Tree @ A @ B @ R3 @ X22 @ Y22 )
=> ( ( rel_Tree @ A @ B @ R3 @ X23 @ Y23 )
=> ( rel_Tree @ A @ B @ R3 @ ( t @ A @ X21 @ X22 @ X23 ) @ ( t @ B @ Y21 @ Y22 @ Y23 ) ) ) ) ) ).
% Tree.rel_intros(2)
thf(fact_87_Tree_Octr__transfer_I1_J,axiom,
! [A: $tType,B: $tType,R3: A > B > $o] : ( rel_Tree @ A @ B @ R3 @ ( e @ A ) @ ( e @ B ) ) ).
% Tree.ctr_transfer(1)
thf(fact_88_Heap__def,axiom,
! [A: $tType,B: $tType] :
( ( linorder @ A )
=> ( ( heap @ B @ A )
= ( ^ [Empty2: B,Is_empty2: B > $o,Of_list2: ( list @ A ) > B,Multiset2: B > ( multiset @ A ),As_tree2: B > ( tree @ A ),Remove_max2: B > ( product_prod @ A @ B )] :
( ( collection @ B @ A @ Empty2 @ Is_empty2 @ Of_list2 @ Multiset2 )
& ( heap_axioms @ B @ A @ Is_empty2 @ Of_list2 @ Multiset2 @ As_tree2 @ Remove_max2 ) ) ) ) ) ).
% Heap_def
thf(fact_89_Heap_Ointro,axiom,
! [A: $tType,B: $tType] :
( ( linorder @ A )
=> ! [Empty: B,Is_empty: B > $o,Of_list: ( list @ A ) > B,Multiset: B > ( multiset @ A ),As_tree: B > ( tree @ A ),Remove_max: B > ( product_prod @ A @ B )] :
( ( collection @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset )
=> ( ( heap_axioms @ B @ A @ Is_empty @ Of_list @ Multiset @ As_tree @ Remove_max )
=> ( heap @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset @ As_tree @ Remove_max ) ) ) ) ).
% Heap.intro
thf(fact_90_Tree_Orel__distinct_I2_J,axiom,
! [A: $tType,B: $tType,R3: A > B > $o,Y21: A,Y22: tree @ A,Y23: tree @ A] :
~ ( rel_Tree @ A @ B @ R3 @ ( t @ A @ Y21 @ Y22 @ Y23 ) @ ( e @ B ) ) ).
% Tree.rel_distinct(2)
thf(fact_91_Tree_Orel__distinct_I1_J,axiom,
! [A: $tType,B: $tType,R3: A > B > $o,Y21: B,Y22: tree @ B,Y23: tree @ B] :
~ ( rel_Tree @ A @ B @ R3 @ ( e @ A ) @ ( t @ B @ Y21 @ Y22 @ Y23 ) ) ).
% Tree.rel_distinct(1)
thf(fact_92_Tree_Orel__cases,axiom,
! [A: $tType,B: $tType,R3: A > B > $o,A2: tree @ A,B2: tree @ B] :
( ( rel_Tree @ A @ B @ R3 @ A2 @ B2 )
=> ( ( ( A2
= ( e @ A ) )
=> ( B2
!= ( e @ B ) ) )
=> ~ ! [X1: A,X2: tree @ A,X3: tree @ A] :
( ( A2
= ( t @ A @ X1 @ X2 @ X3 ) )
=> ! [Y1: B,Y24: tree @ B,Y32: tree @ B] :
( ( B2
= ( t @ B @ Y1 @ Y24 @ Y32 ) )
=> ( ( R3 @ X1 @ Y1 )
=> ( ( rel_Tree @ A @ B @ R3 @ X2 @ Y24 )
=> ~ ( rel_Tree @ A @ B @ R3 @ X3 @ Y32 ) ) ) ) ) ) ) ).
% Tree.rel_cases
thf(fact_93_old_Oprod_Oinject,axiom,
! [A: $tType,B: $tType,A2: A,B2: B,A6: A,B5: B] :
( ( ( product_Pair @ A @ B @ A2 @ B2 )
= ( product_Pair @ A @ B @ A6 @ B5 ) )
= ( ( A2 = A6 )
& ( B2 = B5 ) ) ) ).
% old.prod.inject
thf(fact_94_prod_Oinject,axiom,
! [A: $tType,B: $tType,X12: A,X24: B,Y12: A,Y25: B] :
( ( ( product_Pair @ A @ B @ X12 @ X24 )
= ( product_Pair @ A @ B @ Y12 @ Y25 ) )
= ( ( X12 = Y12 )
& ( X24 = Y25 ) ) ) ).
% prod.inject
thf(fact_95_Heap__axioms__def,axiom,
! [A: $tType,B: $tType] :
( ( linorder @ A )
=> ( ( heap_axioms @ B @ A )
= ( ^ [Is_empty2: B > $o,Of_list2: ( list @ A ) > B,Multiset2: B > ( multiset @ A ),As_tree2: B > ( tree @ A ),Remove_max2: B > ( product_prod @ A @ B )] :
( ! [L4: B] :
( ( Multiset2 @ L4 )
= ( multiset2 @ A @ ( As_tree2 @ L4 ) ) )
& ! [I2: list @ A] : ( is_heap @ A @ ( As_tree2 @ ( Of_list2 @ I2 ) ) )
& ! [T3: B] :
( ( ( As_tree2 @ T3 )
= ( e @ A ) )
= ( Is_empty2 @ T3 ) )
& ! [L4: B,M2: A,L5: B] :
( ~ ( Is_empty2 @ L4 )
=> ( ( ( product_Pair @ A @ B @ M2 @ L5 )
= ( Remove_max2 @ L4 ) )
=> ( ( add_mset @ A @ M2 @ ( Multiset2 @ L5 ) )
= ( Multiset2 @ L4 ) ) ) )
& ! [L4: B,M2: A,L5: B] :
( ~ ( Is_empty2 @ L4 )
=> ( ( is_heap @ A @ ( As_tree2 @ L4 ) )
=> ( ( ( product_Pair @ A @ B @ M2 @ L5 )
= ( Remove_max2 @ L4 ) )
=> ( is_heap @ A @ ( As_tree2 @ L5 ) ) ) ) )
& ! [T3: B,M2: A,T5: B] :
( ~ ( Is_empty2 @ T3 )
=> ( ( ( product_Pair @ A @ B @ M2 @ T5 )
= ( Remove_max2 @ T3 ) )
=> ( M2
= ( val @ A @ ( As_tree2 @ T3 ) ) ) ) ) ) ) ) ) ).
% Heap_axioms_def
thf(fact_96_Heap__axioms_Ointro,axiom,
! [A: $tType,B: $tType] :
( ( linorder @ A )
=> ! [Multiset: B > ( multiset @ A ),As_tree: B > ( tree @ A ),Of_list: ( list @ A ) > B,Is_empty: B > $o,Remove_max: B > ( product_prod @ A @ B )] :
( ! [L6: B] :
( ( Multiset @ L6 )
= ( multiset2 @ A @ ( As_tree @ L6 ) ) )
=> ( ! [I3: list @ A] : ( is_heap @ A @ ( As_tree @ ( Of_list @ I3 ) ) )
=> ( ! [T6: B] :
( ( ( As_tree @ T6 )
= ( e @ A ) )
= ( Is_empty @ T6 ) )
=> ( ! [L6: B,M3: A,L2: B] :
( ~ ( Is_empty @ L6 )
=> ( ( ( product_Pair @ A @ B @ M3 @ L2 )
= ( Remove_max @ L6 ) )
=> ( ( add_mset @ A @ M3 @ ( Multiset @ L2 ) )
= ( Multiset @ L6 ) ) ) )
=> ( ! [L6: B,M3: A,L2: B] :
( ~ ( Is_empty @ L6 )
=> ( ( is_heap @ A @ ( As_tree @ L6 ) )
=> ( ( ( product_Pair @ A @ B @ M3 @ L2 )
= ( Remove_max @ L6 ) )
=> ( is_heap @ A @ ( As_tree @ L2 ) ) ) ) )
=> ( ! [T6: B,M3: A,T7: B] :
( ~ ( Is_empty @ T6 )
=> ( ( ( product_Pair @ A @ B @ M3 @ T7 )
= ( Remove_max @ T6 ) )
=> ( M3
= ( val @ A @ ( As_tree @ T6 ) ) ) ) )
=> ( heap_axioms @ B @ A @ Is_empty @ Of_list @ Multiset @ As_tree @ Remove_max ) ) ) ) ) ) ) ) ).
% Heap_axioms.intro
thf(fact_97_heap__top__geq,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [A2: A,T2: tree @ A] :
( ( member @ A @ A2 @ ( set_mset @ A @ ( multiset2 @ A @ T2 ) ) )
=> ( ( is_heap @ A @ T2 )
=> ( ord_less_eq @ A @ A2 @ ( val @ A @ T2 ) ) ) ) ) ).
% heap_top_geq
thf(fact_98_Collection_Ois__empty__empty,axiom,
! [A: $tType,B: $tType,Empty: B,Is_empty: B > $o,Of_list: ( list @ A ) > B,Multiset: B > ( multiset @ A )] :
( ( collection @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset )
=> ( Is_empty @ Empty ) ) ).
% Collection.is_empty_empty
thf(fact_99_predicate2I,axiom,
! [B: $tType,A: $tType,P: A > B > $o,Q: A > B > $o] :
( ! [X4: A,Y2: B] :
( ( P @ X4 @ Y2 )
=> ( Q @ X4 @ Y2 ) )
=> ( ord_less_eq @ ( A > B > $o ) @ P @ Q ) ) ).
% predicate2I
thf(fact_100_rev__predicate2D,axiom,
! [A: $tType,B: $tType,P: A > B > $o,X: A,Y: B,Q: A > B > $o] :
( ( P @ X @ Y )
=> ( ( ord_less_eq @ ( A > B > $o ) @ P @ Q )
=> ( Q @ X @ Y ) ) ) ).
% rev_predicate2D
thf(fact_101_predicate2D,axiom,
! [A: $tType,B: $tType,P: A > B > $o,Q: A > B > $o,X: A,Y: B] :
( ( ord_less_eq @ ( A > B > $o ) @ P @ Q )
=> ( ( P @ X @ Y )
=> ( Q @ X @ Y ) ) ) ).
% predicate2D
thf(fact_102_Heap_Oremove__max__multiset_H,axiom,
! [A: $tType,B: $tType] :
( ( linorder @ A )
=> ! [Empty: B,Is_empty: B > $o,Of_list: ( list @ A ) > B,Multiset: B > ( multiset @ A ),As_tree: B > ( tree @ A ),Remove_max: B > ( product_prod @ A @ B ),L: B,M: A,L3: B] :
( ( heap @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset @ As_tree @ Remove_max )
=> ( ~ ( Is_empty @ L )
=> ( ( ( product_Pair @ A @ B @ M @ L3 )
= ( Remove_max @ L ) )
=> ( ( add_mset @ A @ M @ ( Multiset @ L3 ) )
= ( Multiset @ L ) ) ) ) ) ) ).
% Heap.remove_max_multiset'
thf(fact_103_surj__pair,axiom,
! [A: $tType,B: $tType,P2: product_prod @ A @ B] :
? [X4: A,Y2: B] :
( P2
= ( product_Pair @ A @ B @ X4 @ Y2 ) ) ).
% surj_pair
thf(fact_104_prod__cases,axiom,
! [B: $tType,A: $tType,P: ( product_prod @ A @ B ) > $o,P2: product_prod @ A @ B] :
( ! [A5: A,B4: B] : ( P @ ( product_Pair @ A @ B @ A5 @ B4 ) )
=> ( P @ P2 ) ) ).
% prod_cases
thf(fact_105_Pair__inject,axiom,
! [A: $tType,B: $tType,A2: A,B2: B,A6: A,B5: B] :
( ( ( product_Pair @ A @ B @ A2 @ B2 )
= ( product_Pair @ A @ B @ A6 @ B5 ) )
=> ~ ( ( A2 = A6 )
=> ( B2 != B5 ) ) ) ).
% Pair_inject
thf(fact_106_prod__cases3,axiom,
! [A: $tType,B: $tType,C: $tType,Y: product_prod @ A @ ( product_prod @ B @ C )] :
~ ! [A5: A,B4: B,C3: C] :
( Y
!= ( product_Pair @ A @ ( product_prod @ B @ C ) @ A5 @ ( product_Pair @ B @ C @ B4 @ C3 ) ) ) ).
% prod_cases3
thf(fact_107_prod__cases4,axiom,
! [A: $tType,B: $tType,C: $tType,D: $tType,Y: product_prod @ A @ ( product_prod @ B @ ( product_prod @ C @ D ) )] :
~ ! [A5: A,B4: B,C3: C,D2: D] :
( Y
!= ( product_Pair @ A @ ( product_prod @ B @ ( product_prod @ C @ D ) ) @ A5 @ ( product_Pair @ B @ ( product_prod @ C @ D ) @ B4 @ ( product_Pair @ C @ D @ C3 @ D2 ) ) ) ) ).
% prod_cases4
thf(fact_108_prod__cases5,axiom,
! [A: $tType,B: $tType,C: $tType,D: $tType,E: $tType,Y: product_prod @ A @ ( product_prod @ B @ ( product_prod @ C @ ( product_prod @ D @ E ) ) )] :
~ ! [A5: A,B4: B,C3: C,D2: D,E2: E] :
( Y
!= ( product_Pair @ A @ ( product_prod @ B @ ( product_prod @ C @ ( product_prod @ D @ E ) ) ) @ A5 @ ( product_Pair @ B @ ( product_prod @ C @ ( product_prod @ D @ E ) ) @ B4 @ ( product_Pair @ C @ ( product_prod @ D @ E ) @ C3 @ ( product_Pair @ D @ E @ D2 @ E2 ) ) ) ) ) ).
% prod_cases5
thf(fact_109_prod__cases6,axiom,
! [A: $tType,B: $tType,C: $tType,D: $tType,E: $tType,F3: $tType,Y: product_prod @ A @ ( product_prod @ B @ ( product_prod @ C @ ( product_prod @ D @ ( product_prod @ E @ F3 ) ) ) )] :
~ ! [A5: A,B4: B,C3: C,D2: D,E2: E,F4: F3] :
( Y
!= ( product_Pair @ A @ ( product_prod @ B @ ( product_prod @ C @ ( product_prod @ D @ ( product_prod @ E @ F3 ) ) ) ) @ A5 @ ( product_Pair @ B @ ( product_prod @ C @ ( product_prod @ D @ ( product_prod @ E @ F3 ) ) ) @ B4 @ ( product_Pair @ C @ ( product_prod @ D @ ( product_prod @ E @ F3 ) ) @ C3 @ ( product_Pair @ D @ ( product_prod @ E @ F3 ) @ D2 @ ( product_Pair @ E @ F3 @ E2 @ F4 ) ) ) ) ) ) ).
% prod_cases6
thf(fact_110_prod__cases7,axiom,
! [A: $tType,B: $tType,C: $tType,D: $tType,E: $tType,F3: $tType,G3: $tType,Y: product_prod @ A @ ( product_prod @ B @ ( product_prod @ C @ ( product_prod @ D @ ( product_prod @ E @ ( product_prod @ F3 @ G3 ) ) ) ) )] :
~ ! [A5: A,B4: B,C3: C,D2: D,E2: E,F4: F3,G4: G3] :
( Y
!= ( product_Pair @ A @ ( product_prod @ B @ ( product_prod @ C @ ( product_prod @ D @ ( product_prod @ E @ ( product_prod @ F3 @ G3 ) ) ) ) ) @ A5 @ ( product_Pair @ B @ ( product_prod @ C @ ( product_prod @ D @ ( product_prod @ E @ ( product_prod @ F3 @ G3 ) ) ) ) @ B4 @ ( product_Pair @ C @ ( product_prod @ D @ ( product_prod @ E @ ( product_prod @ F3 @ G3 ) ) ) @ C3 @ ( product_Pair @ D @ ( product_prod @ E @ ( product_prod @ F3 @ G3 ) ) @ D2 @ ( product_Pair @ E @ ( product_prod @ F3 @ G3 ) @ E2 @ ( product_Pair @ F3 @ G3 @ F4 @ G4 ) ) ) ) ) ) ) ).
% prod_cases7
thf(fact_111_prod__induct3,axiom,
! [C: $tType,B: $tType,A: $tType,P: ( product_prod @ A @ ( product_prod @ B @ C ) ) > $o,X: product_prod @ A @ ( product_prod @ B @ C )] :
( ! [A5: A,B4: B,C3: C] : ( P @ ( product_Pair @ A @ ( product_prod @ B @ C ) @ A5 @ ( product_Pair @ B @ C @ B4 @ C3 ) ) )
=> ( P @ X ) ) ).
% prod_induct3
thf(fact_112_prod__induct4,axiom,
! [D: $tType,C: $tType,B: $tType,A: $tType,P: ( product_prod @ A @ ( product_prod @ B @ ( product_prod @ C @ D ) ) ) > $o,X: product_prod @ A @ ( product_prod @ B @ ( product_prod @ C @ D ) )] :
( ! [A5: A,B4: B,C3: C,D2: D] : ( P @ ( product_Pair @ A @ ( product_prod @ B @ ( product_prod @ C @ D ) ) @ A5 @ ( product_Pair @ B @ ( product_prod @ C @ D ) @ B4 @ ( product_Pair @ C @ D @ C3 @ D2 ) ) ) )
=> ( P @ X ) ) ).
% prod_induct4
thf(fact_113_prod__induct5,axiom,
! [E: $tType,D: $tType,C: $tType,B: $tType,A: $tType,P: ( product_prod @ A @ ( product_prod @ B @ ( product_prod @ C @ ( product_prod @ D @ E ) ) ) ) > $o,X: product_prod @ A @ ( product_prod @ B @ ( product_prod @ C @ ( product_prod @ D @ E ) ) )] :
( ! [A5: A,B4: B,C3: C,D2: D,E2: E] : ( P @ ( product_Pair @ A @ ( product_prod @ B @ ( product_prod @ C @ ( product_prod @ D @ E ) ) ) @ A5 @ ( product_Pair @ B @ ( product_prod @ C @ ( product_prod @ D @ E ) ) @ B4 @ ( product_Pair @ C @ ( product_prod @ D @ E ) @ C3 @ ( product_Pair @ D @ E @ D2 @ E2 ) ) ) ) )
=> ( P @ X ) ) ).
% prod_induct5
thf(fact_114_prod__induct6,axiom,
! [F3: $tType,E: $tType,D: $tType,C: $tType,B: $tType,A: $tType,P: ( product_prod @ A @ ( product_prod @ B @ ( product_prod @ C @ ( product_prod @ D @ ( product_prod @ E @ F3 ) ) ) ) ) > $o,X: product_prod @ A @ ( product_prod @ B @ ( product_prod @ C @ ( product_prod @ D @ ( product_prod @ E @ F3 ) ) ) )] :
( ! [A5: A,B4: B,C3: C,D2: D,E2: E,F4: F3] : ( P @ ( product_Pair @ A @ ( product_prod @ B @ ( product_prod @ C @ ( product_prod @ D @ ( product_prod @ E @ F3 ) ) ) ) @ A5 @ ( product_Pair @ B @ ( product_prod @ C @ ( product_prod @ D @ ( product_prod @ E @ F3 ) ) ) @ B4 @ ( product_Pair @ C @ ( product_prod @ D @ ( product_prod @ E @ F3 ) ) @ C3 @ ( product_Pair @ D @ ( product_prod @ E @ F3 ) @ D2 @ ( product_Pair @ E @ F3 @ E2 @ F4 ) ) ) ) ) )
=> ( P @ X ) ) ).
% prod_induct6
thf(fact_115_prod__induct7,axiom,
! [G3: $tType,F3: $tType,E: $tType,D: $tType,C: $tType,B: $tType,A: $tType,P: ( product_prod @ A @ ( product_prod @ B @ ( product_prod @ C @ ( product_prod @ D @ ( product_prod @ E @ ( product_prod @ F3 @ G3 ) ) ) ) ) ) > $o,X: product_prod @ A @ ( product_prod @ B @ ( product_prod @ C @ ( product_prod @ D @ ( product_prod @ E @ ( product_prod @ F3 @ G3 ) ) ) ) )] :
( ! [A5: A,B4: B,C3: C,D2: D,E2: E,F4: F3,G4: G3] : ( P @ ( product_Pair @ A @ ( product_prod @ B @ ( product_prod @ C @ ( product_prod @ D @ ( product_prod @ E @ ( product_prod @ F3 @ G3 ) ) ) ) ) @ A5 @ ( product_Pair @ B @ ( product_prod @ C @ ( product_prod @ D @ ( product_prod @ E @ ( product_prod @ F3 @ G3 ) ) ) ) @ B4 @ ( product_Pair @ C @ ( product_prod @ D @ ( product_prod @ E @ ( product_prod @ F3 @ G3 ) ) ) @ C3 @ ( product_Pair @ D @ ( product_prod @ E @ ( product_prod @ F3 @ G3 ) ) @ D2 @ ( product_Pair @ E @ ( product_prod @ F3 @ G3 ) @ E2 @ ( product_Pair @ F3 @ G3 @ F4 @ G4 ) ) ) ) ) ) )
=> ( P @ X ) ) ).
% prod_induct7
thf(fact_116_old_Oprod_Oexhaust,axiom,
! [A: $tType,B: $tType,Y: product_prod @ A @ B] :
~ ! [A5: A,B4: B] :
( Y
!= ( product_Pair @ A @ B @ A5 @ B4 ) ) ).
% old.prod.exhaust
thf(fact_117_old_Oprod_Oinducts,axiom,
! [B: $tType,A: $tType,P: ( product_prod @ A @ B ) > $o,Prod: product_prod @ A @ B] :
( ! [A5: A,B4: B] : ( P @ ( product_Pair @ A @ B @ A5 @ B4 ) )
=> ( P @ Prod ) ) ).
% old.prod.inducts
thf(fact_118_Collection_Ois__empty__inj,axiom,
! [A: $tType,B: $tType,Empty: B,Is_empty: B > $o,Of_list: ( list @ A ) > B,Multiset: B > ( multiset @ A ),E3: B] :
( ( collection @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset )
=> ( ( Is_empty @ E3 )
=> ( E3 = Empty ) ) ) ).
% Collection.is_empty_inj
thf(fact_119_old_Oprod_Orec,axiom,
! [A: $tType,T: $tType,B: $tType,F1: A > B > T,A2: A,B2: B] :
( ( product_rec_prod @ A @ B @ T @ F1 @ ( product_Pair @ A @ B @ A2 @ B2 ) )
= ( F1 @ A2 @ B2 ) ) ).
% old.prod.rec
thf(fact_120_add__mset__add__mset__same__iff,axiom,
! [A: $tType,A2: A,A3: multiset @ A,B6: multiset @ A] :
( ( ( add_mset @ A @ A2 @ A3 )
= ( add_mset @ A @ A2 @ B6 ) )
= ( A3 = B6 ) ) ).
% add_mset_add_mset_same_iff
thf(fact_121_multi__self__add__other__not__self,axiom,
! [A: $tType,M4: multiset @ A,X: A] :
( M4
!= ( add_mset @ A @ X @ M4 ) ) ).
% multi_self_add_other_not_self
thf(fact_122_mset__add,axiom,
! [A: $tType,A2: A,A3: multiset @ A] :
( ( member @ A @ A2 @ ( set_mset @ A @ A3 ) )
=> ~ ! [B7: multiset @ A] :
( A3
!= ( add_mset @ A @ A2 @ B7 ) ) ) ).
% mset_add
thf(fact_123_multi__member__split,axiom,
! [A: $tType,X: A,M4: multiset @ A] :
( ( member @ A @ X @ ( set_mset @ A @ M4 ) )
=> ? [A7: multiset @ A] :
( M4
= ( add_mset @ A @ X @ A7 ) ) ) ).
% multi_member_split
thf(fact_124_add__mset__commute,axiom,
! [A: $tType,X: A,Y: A,M4: multiset @ A] :
( ( add_mset @ A @ X @ ( add_mset @ A @ Y @ M4 ) )
= ( add_mset @ A @ Y @ ( add_mset @ A @ X @ M4 ) ) ) ).
% add_mset_commute
thf(fact_125_add__eq__conv__ex,axiom,
! [A: $tType,A2: A,M4: multiset @ A,B2: A,N: multiset @ A] :
( ( ( add_mset @ A @ A2 @ M4 )
= ( add_mset @ A @ B2 @ N ) )
= ( ( ( M4 = N )
& ( A2 = B2 ) )
| ? [K: multiset @ A] :
( ( M4
= ( add_mset @ A @ B2 @ K ) )
& ( N
= ( add_mset @ A @ A2 @ K ) ) ) ) ) ).
% add_eq_conv_ex
thf(fact_126_union__single__eq__member,axiom,
! [A: $tType,X: A,M4: multiset @ A,N: multiset @ A] :
( ( ( add_mset @ A @ X @ M4 )
= N )
=> ( member @ A @ X @ ( set_mset @ A @ N ) ) ) ).
% union_single_eq_member
thf(fact_127_insert__noteq__member,axiom,
! [A: $tType,B2: A,B6: multiset @ A,C2: A,C4: multiset @ A] :
( ( ( add_mset @ A @ B2 @ B6 )
= ( add_mset @ A @ C2 @ C4 ) )
=> ( ( B2 != C2 )
=> ( member @ A @ C2 @ ( set_mset @ A @ B6 ) ) ) ) ).
% insert_noteq_member
thf(fact_128_heap__top__max,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [T2: tree @ A] :
( ( T2
!= ( e @ A ) )
=> ( ( is_heap @ A @ T2 )
=> ( ( val @ A @ T2 )
= ( lattic929149872er_Max @ A @ ( set_mset @ A @ ( multiset2 @ A @ T2 ) ) ) ) ) ) ) ).
% heap_top_max
thf(fact_129_internal__case__prod__conv,axiom,
! [B: $tType,A: $tType,C: $tType,C2: B > C > A,A2: B,B2: C] :
( ( produc2004651681e_prod @ B @ C @ A @ C2 @ ( product_Pair @ B @ C @ A2 @ B2 ) )
= ( C2 @ A2 @ B2 ) ) ).
% internal_case_prod_conv
thf(fact_130_Collection_Oset__def,axiom,
! [A: $tType,B: $tType,Empty: B,Is_empty: B > $o,Of_list: ( list @ A ) > B,Multiset: B > ( multiset @ A ),L: B] :
( ( collection @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset )
=> ( ( set2 @ B @ A @ Multiset @ L )
= ( set_mset @ A @ ( Multiset @ L ) ) ) ) ).
% Collection.set_def
thf(fact_131_relChain__def,axiom,
! [B: $tType,A: $tType] :
( ( ord @ B )
=> ( ( bNF_Ca1785829860lChain @ A @ B )
= ( ^ [R4: set @ ( product_prod @ A @ A ),As: A > B] :
! [I2: A,J: A] :
( ( member @ ( product_prod @ A @ A ) @ ( product_Pair @ A @ A @ I2 @ J ) @ R4 )
=> ( ord_less_eq @ B @ ( As @ I2 ) @ ( As @ J ) ) ) ) ) ) ).
% relChain_def
thf(fact_132_Collection_Oset_Ocong,axiom,
! [A: $tType,B: $tType] :
( ( set2 @ B @ A )
= ( set2 @ B @ A ) ) ).
% Collection.set.cong
thf(fact_133_RemoveMax__axioms_Ointro,axiom,
! [A: $tType,B: $tType] :
( ( linorder @ A )
=> ! [Inv: B > $o,Of_list: ( list @ A ) > B,Is_empty: B > $o,Remove_max: B > ( product_prod @ A @ B ),Multiset: B > ( multiset @ A )] :
( ! [X4: list @ A] : ( Inv @ ( Of_list @ X4 ) )
=> ( ! [L6: B,M3: A,L2: B] :
( ~ ( Is_empty @ L6 )
=> ( ( Inv @ L6 )
=> ( ( ( product_Pair @ A @ B @ M3 @ L2 )
= ( Remove_max @ L6 ) )
=> ( M3
= ( lattic929149872er_Max @ A @ ( set2 @ B @ A @ Multiset @ L6 ) ) ) ) ) )
=> ( ! [L6: B,M3: A,L2: B] :
( ~ ( Is_empty @ L6 )
=> ( ( Inv @ L6 )
=> ( ( ( product_Pair @ A @ B @ M3 @ L2 )
= ( Remove_max @ L6 ) )
=> ( ( add_mset @ A @ M3 @ ( Multiset @ L2 ) )
= ( Multiset @ L6 ) ) ) ) )
=> ( ! [L6: B,M3: A,L2: B] :
( ~ ( Is_empty @ L6 )
=> ( ( Inv @ L6 )
=> ( ( ( product_Pair @ A @ B @ M3 @ L2 )
= ( Remove_max @ L6 ) )
=> ( Inv @ L2 ) ) ) )
=> ( removeMax_axioms @ B @ A @ Is_empty @ Of_list @ Multiset @ Remove_max @ Inv ) ) ) ) ) ) ).
% RemoveMax_axioms.intro
thf(fact_134_RemoveMax__axioms__def,axiom,
! [A: $tType,B: $tType] :
( ( linorder @ A )
=> ( ( removeMax_axioms @ B @ A )
= ( ^ [Is_empty2: B > $o,Of_list2: ( list @ A ) > B,Multiset2: B > ( multiset @ A ),Remove_max2: B > ( product_prod @ A @ B ),Inv2: B > $o] :
( ! [X5: list @ A] : ( Inv2 @ ( Of_list2 @ X5 ) )
& ! [L4: B,M2: A,L5: B] :
( ~ ( Is_empty2 @ L4 )
=> ( ( Inv2 @ L4 )
=> ( ( ( product_Pair @ A @ B @ M2 @ L5 )
= ( Remove_max2 @ L4 ) )
=> ( M2
= ( lattic929149872er_Max @ A @ ( set2 @ B @ A @ Multiset2 @ L4 ) ) ) ) ) )
& ! [L4: B,M2: A,L5: B] :
( ~ ( Is_empty2 @ L4 )
=> ( ( Inv2 @ L4 )
=> ( ( ( product_Pair @ A @ B @ M2 @ L5 )
= ( Remove_max2 @ L4 ) )
=> ( ( add_mset @ A @ M2 @ ( Multiset2 @ L5 ) )
= ( Multiset2 @ L4 ) ) ) ) )
& ! [L4: B,M2: A,L5: B] :
( ~ ( Is_empty2 @ L4 )
=> ( ( Inv2 @ L4 )
=> ( ( ( product_Pair @ A @ B @ M2 @ L5 )
= ( Remove_max2 @ L4 ) )
=> ( Inv2 @ L5 ) ) ) ) ) ) ) ) ).
% RemoveMax_axioms_def
thf(fact_135_RemoveMax_Oremove__max__max,axiom,
! [A: $tType,B: $tType] :
( ( linorder @ A )
=> ! [Empty: B,Is_empty: B > $o,Of_list: ( list @ A ) > B,Multiset: B > ( multiset @ A ),Remove_max: B > ( product_prod @ A @ B ),Inv: B > $o,L: B,M: A,L3: B] :
( ( removeMax @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset @ Remove_max @ Inv )
=> ( ~ ( Is_empty @ L )
=> ( ( Inv @ L )
=> ( ( ( product_Pair @ A @ B @ M @ L3 )
= ( Remove_max @ L ) )
=> ( M
= ( lattic929149872er_Max @ A @ ( set2 @ B @ A @ Multiset @ L ) ) ) ) ) ) ) ) ).
% RemoveMax.remove_max_max
thf(fact_136_predicate2D__conj,axiom,
! [A: $tType,B: $tType,P: A > B > $o,Q: A > B > $o,R3: $o,X: A,Y: B] :
( ( ( ord_less_eq @ ( A > B > $o ) @ P @ Q )
& R3 )
=> ( R3
& ( ( P @ X @ Y )
=> ( Q @ X @ Y ) ) ) ) ).
% predicate2D_conj
thf(fact_137_RemoveMax_Oremove__max__inv,axiom,
! [A: $tType,B: $tType] :
( ( linorder @ A )
=> ! [Empty: B,Is_empty: B > $o,Of_list: ( list @ A ) > B,Multiset: B > ( multiset @ A ),Remove_max: B > ( product_prod @ A @ B ),Inv: B > $o,L: B,M: A,L3: B] :
( ( removeMax @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset @ Remove_max @ Inv )
=> ( ~ ( Is_empty @ L )
=> ( ( Inv @ L )
=> ( ( ( product_Pair @ A @ B @ M @ L3 )
= ( Remove_max @ L ) )
=> ( Inv @ L3 ) ) ) ) ) ) ).
% RemoveMax.remove_max_inv
thf(fact_138_RemoveMax_Oaxioms_I2_J,axiom,
! [A: $tType,B: $tType] :
( ( linorder @ A )
=> ! [Empty: B,Is_empty: B > $o,Of_list: ( list @ A ) > B,Multiset: B > ( multiset @ A ),Remove_max: B > ( product_prod @ A @ B ),Inv: B > $o] :
( ( removeMax @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset @ Remove_max @ Inv )
=> ( removeMax_axioms @ B @ A @ Is_empty @ Of_list @ Multiset @ Remove_max @ Inv ) ) ) ).
% RemoveMax.axioms(2)
thf(fact_139_RemoveMax_Oof__list__inv,axiom,
! [B: $tType,A: $tType] :
( ( linorder @ A )
=> ! [Empty: B,Is_empty: B > $o,Of_list: ( list @ A ) > B,Multiset: B > ( multiset @ A ),Remove_max: B > ( product_prod @ A @ B ),Inv: B > $o,X: list @ A] :
( ( removeMax @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset @ Remove_max @ Inv )
=> ( Inv @ ( Of_list @ X ) ) ) ) ).
% RemoveMax.of_list_inv
thf(fact_140_RemoveMax_Ointro,axiom,
! [A: $tType,B: $tType] :
( ( linorder @ A )
=> ! [Empty: B,Is_empty: B > $o,Of_list: ( list @ A ) > B,Multiset: B > ( multiset @ A ),Remove_max: B > ( product_prod @ A @ B ),Inv: B > $o] :
( ( collection @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset )
=> ( ( removeMax_axioms @ B @ A @ Is_empty @ Of_list @ Multiset @ Remove_max @ Inv )
=> ( removeMax @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset @ Remove_max @ Inv ) ) ) ) ).
% RemoveMax.intro
thf(fact_141_RemoveMax__def,axiom,
! [A: $tType,B: $tType] :
( ( linorder @ A )
=> ( ( removeMax @ B @ A )
= ( ^ [Empty2: B,Is_empty2: B > $o,Of_list2: ( list @ A ) > B,Multiset2: B > ( multiset @ A ),Remove_max2: B > ( product_prod @ A @ B ),Inv2: B > $o] :
( ( collection @ B @ A @ Empty2 @ Is_empty2 @ Of_list2 @ Multiset2 )
& ( removeMax_axioms @ B @ A @ Is_empty2 @ Of_list2 @ Multiset2 @ Remove_max2 @ Inv2 ) ) ) ) ) ).
% RemoveMax_def
thf(fact_142_RemoveMax_Oaxioms_I1_J,axiom,
! [A: $tType,B: $tType] :
( ( linorder @ A )
=> ! [Empty: B,Is_empty: B > $o,Of_list: ( list @ A ) > B,Multiset: B > ( multiset @ A ),Remove_max: B > ( product_prod @ A @ B ),Inv: B > $o] :
( ( removeMax @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset @ Remove_max @ Inv )
=> ( collection @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset ) ) ) ).
% RemoveMax.axioms(1)
thf(fact_143_RemoveMax_Oremove__max__multiset,axiom,
! [A: $tType,B: $tType] :
( ( linorder @ A )
=> ! [Empty: B,Is_empty: B > $o,Of_list: ( list @ A ) > B,Multiset: B > ( multiset @ A ),Remove_max: B > ( product_prod @ A @ B ),Inv: B > $o,L: B,M: A,L3: B] :
( ( removeMax @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset @ Remove_max @ Inv )
=> ( ~ ( Is_empty @ L )
=> ( ( Inv @ L )
=> ( ( ( product_Pair @ A @ B @ M @ L3 )
= ( Remove_max @ L ) )
=> ( ( add_mset @ A @ M @ ( Multiset @ L3 ) )
= ( Multiset @ L ) ) ) ) ) ) ) ).
% RemoveMax.remove_max_multiset
thf(fact_144_ge__eq__refl,axiom,
! [A: $tType,R3: A > A > $o,X: A] :
( ( ord_less_eq @ ( A > A > $o )
@ ^ [Y3: A,Z: A] : Y3 = Z
@ R3 )
=> ( R3 @ X @ X ) ) ).
% ge_eq_refl
thf(fact_145_refl__ge__eq,axiom,
! [A: $tType,R3: A > A > $o] :
( ! [X4: A] : ( R3 @ X4 @ X4 )
=> ( ord_less_eq @ ( A > A > $o )
@ ^ [Y3: A,Z: A] : Y3 = Z
@ R3 ) ) ).
% refl_ge_eq
thf(fact_146_multiset__induct__max,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [P: ( multiset @ A ) > $o,M4: multiset @ A] :
( ( P @ ( zero_zero @ ( multiset @ A ) ) )
=> ( ! [X4: A,M5: multiset @ A] :
( ( P @ M5 )
=> ( ! [Xa: A] :
( ( member @ A @ Xa @ ( set_mset @ A @ M5 ) )
=> ( ord_less_eq @ A @ Xa @ X4 ) )
=> ( P @ ( add_mset @ A @ X4 @ M5 ) ) ) )
=> ( P @ M4 ) ) ) ) ).
% multiset_induct_max
thf(fact_147_multiset__induct__min,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [P: ( multiset @ A ) > $o,M4: multiset @ A] :
( ( P @ ( zero_zero @ ( multiset @ A ) ) )
=> ( ! [X4: A,M5: multiset @ A] :
( ( P @ M5 )
=> ( ! [Xa: A] :
( ( member @ A @ Xa @ ( set_mset @ A @ M5 ) )
=> ( ord_less_eq @ A @ X4 @ Xa ) )
=> ( P @ ( add_mset @ A @ X4 @ M5 ) ) ) )
=> ( P @ M4 ) ) ) ) ).
% multiset_induct_min
thf(fact_148_add__mset__eq__singleton__iff,axiom,
! [A: $tType,X: A,M4: multiset @ A,Y: A] :
( ( ( add_mset @ A @ X @ M4 )
= ( add_mset @ A @ Y @ ( zero_zero @ ( multiset @ A ) ) ) )
= ( ( M4
= ( zero_zero @ ( multiset @ A ) ) )
& ( X = Y ) ) ) ).
% add_mset_eq_singleton_iff
thf(fact_149_single__eq__add__mset,axiom,
! [A: $tType,A2: A,B2: A,M4: multiset @ A] :
( ( ( add_mset @ A @ A2 @ ( zero_zero @ ( multiset @ A ) ) )
= ( add_mset @ A @ B2 @ M4 ) )
= ( ( B2 = A2 )
& ( M4
= ( zero_zero @ ( multiset @ A ) ) ) ) ) ).
% single_eq_add_mset
thf(fact_150_add__mset__eq__single,axiom,
! [A: $tType,B2: A,M4: multiset @ A,A2: A] :
( ( ( add_mset @ A @ B2 @ M4 )
= ( add_mset @ A @ A2 @ ( zero_zero @ ( multiset @ A ) ) ) )
= ( ( B2 = A2 )
& ( M4
= ( zero_zero @ ( multiset @ A ) ) ) ) ) ).
% add_mset_eq_single
thf(fact_151_single__eq__single,axiom,
! [A: $tType,A2: A,B2: A] :
( ( ( add_mset @ A @ A2 @ ( zero_zero @ ( multiset @ A ) ) )
= ( add_mset @ A @ B2 @ ( zero_zero @ ( multiset @ A ) ) ) )
= ( A2 = B2 ) ) ).
% single_eq_single
thf(fact_152_multiset__cases,axiom,
! [A: $tType,M4: multiset @ A] :
( ( M4
!= ( zero_zero @ ( multiset @ A ) ) )
=> ~ ! [X4: A,N2: multiset @ A] :
( M4
!= ( add_mset @ A @ X4 @ N2 ) ) ) ).
% multiset_cases
thf(fact_153_multiset__induct,axiom,
! [A: $tType,P: ( multiset @ A ) > $o,M4: multiset @ A] :
( ( P @ ( zero_zero @ ( multiset @ A ) ) )
=> ( ! [X4: A,M5: multiset @ A] :
( ( P @ M5 )
=> ( P @ ( add_mset @ A @ X4 @ M5 ) ) )
=> ( P @ M4 ) ) ) ).
% multiset_induct
thf(fact_154_multiset__induct2,axiom,
! [A: $tType,B: $tType,P: ( multiset @ A ) > ( multiset @ B ) > $o,M4: multiset @ A,N: multiset @ B] :
( ( P @ ( zero_zero @ ( multiset @ A ) ) @ ( zero_zero @ ( multiset @ B ) ) )
=> ( ! [A5: A,M5: multiset @ A,N2: multiset @ B] :
( ( P @ M5 @ N2 )
=> ( P @ ( add_mset @ A @ A5 @ M5 ) @ N2 ) )
=> ( ! [A5: B,M5: multiset @ A,N2: multiset @ B] :
( ( P @ M5 @ N2 )
=> ( P @ M5 @ ( add_mset @ B @ A5 @ N2 ) ) )
=> ( P @ M4 @ N ) ) ) ) ).
% multiset_induct2
thf(fact_155_empty__not__add__mset,axiom,
! [A: $tType,A2: A,A3: multiset @ A] :
( ( zero_zero @ ( multiset @ A ) )
!= ( add_mset @ A @ A2 @ A3 ) ) ).
% empty_not_add_mset
thf(fact_156_multiset__nonemptyE,axiom,
! [A: $tType,A3: multiset @ A] :
( ( A3
!= ( zero_zero @ ( multiset @ A ) ) )
=> ~ ! [X4: A] :
~ ( member @ A @ X4 @ ( set_mset @ A @ A3 ) ) ) ).
% multiset_nonemptyE
thf(fact_157_multi__nonempty__split,axiom,
! [A: $tType,M4: multiset @ A] :
( ( M4
!= ( zero_zero @ ( multiset @ A ) ) )
=> ? [A7: multiset @ A,A5: A] :
( M4
= ( add_mset @ A @ A5 @ A7 ) ) ) ).
% multi_nonempty_split
thf(fact_158_Collection_Ois__empty__as__list,axiom,
! [B: $tType,A: $tType,Empty: B,Is_empty: B > $o,Of_list: ( list @ A ) > B,Multiset: B > ( multiset @ A ),E3: B] :
( ( collection @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset )
=> ( ( Is_empty @ E3 )
=> ( ( Multiset @ E3 )
= ( zero_zero @ ( multiset @ A ) ) ) ) ) ).
% Collection.is_empty_as_list
thf(fact_159_Collection_Omultiset__empty,axiom,
! [B: $tType,A: $tType,Empty: B,Is_empty: B > $o,Of_list: ( list @ A ) > B,Multiset: B > ( multiset @ A )] :
( ( collection @ B @ A @ Empty @ Is_empty @ Of_list @ Multiset )
=> ( ( Multiset @ Empty )
= ( zero_zero @ ( multiset @ A ) ) ) ) ).
% Collection.multiset_empty
thf(fact_160_multi__member__last,axiom,
! [A: $tType,X: A] : ( member @ A @ X @ ( set_mset @ A @ ( add_mset @ A @ X @ ( zero_zero @ ( multiset @ A ) ) ) ) ) ).
% multi_member_last
thf(fact_161_multiset_Osimps_I1_J,axiom,
! [A: $tType] :
( ( multiset2 @ A @ ( e @ A ) )
= ( zero_zero @ ( multiset @ A ) ) ) ).
% multiset.simps(1)
thf(fact_162_le__zero__eq,axiom,
! [A: $tType] :
( ( canoni770627133id_add @ A )
=> ! [N3: A] :
( ( ord_less_eq @ A @ N3 @ ( zero_zero @ A ) )
= ( N3
= ( zero_zero @ A ) ) ) ) ).
% le_zero_eq
thf(fact_163_zero__le,axiom,
! [A: $tType] :
( ( canoni770627133id_add @ A )
=> ! [X: A] : ( ord_less_eq @ A @ ( zero_zero @ A ) @ X ) ) ).
% zero_le
thf(fact_164_le__numeral__extra_I3_J,axiom,
! [A: $tType] :
( ( linord1659791738miring @ A )
=> ( ord_less_eq @ A @ ( zero_zero @ A ) @ ( zero_zero @ A ) ) ) ).
% le_numeral_extra(3)
thf(fact_165_multiset_Osimps_I2_J,axiom,
! [A: $tType,V: A,L: tree @ A,R: tree @ A] :
( ( multiset2 @ A @ ( t @ A @ V @ L @ R ) )
= ( plus_plus @ ( multiset @ A ) @ ( plus_plus @ ( multiset @ A ) @ ( multiset2 @ A @ L ) @ ( add_mset @ A @ V @ ( zero_zero @ ( multiset @ A ) ) ) ) @ ( multiset2 @ A @ R ) ) ) ).
% multiset.simps(2)
thf(fact_166_divides__aux__eq,axiom,
! [A: $tType] :
( ( unique1598680935umeral @ A )
=> ! [Q2: A,R: A] :
( ( unique455577585es_aux @ A @ ( product_Pair @ A @ A @ Q2 @ R ) )
= ( R
= ( zero_zero @ A ) ) ) ) ).
% divides_aux_eq
thf(fact_167_single__subset__iff,axiom,
! [A: $tType,A2: A,M4: multiset @ A] :
( ( subseteq_mset @ A @ ( add_mset @ A @ A2 @ ( zero_zero @ ( multiset @ A ) ) ) @ M4 )
= ( member @ A @ A2 @ ( set_mset @ A @ M4 ) ) ) ).
% single_subset_iff
thf(fact_168_add__le__cancel__left,axiom,
! [A: $tType] :
( ( ordere236663937imp_le @ A )
=> ! [C2: A,A2: A,B2: A] :
( ( ord_less_eq @ A @ ( plus_plus @ A @ C2 @ A2 ) @ ( plus_plus @ A @ C2 @ B2 ) )
= ( ord_less_eq @ A @ A2 @ B2 ) ) ) ).
% add_le_cancel_left
thf(fact_169_add__le__cancel__right,axiom,
! [A: $tType] :
( ( ordere236663937imp_le @ A )
=> ! [A2: A,C2: A,B2: A] :
( ( ord_less_eq @ A @ ( plus_plus @ A @ A2 @ C2 ) @ ( plus_plus @ A @ B2 @ C2 ) )
= ( ord_less_eq @ A @ A2 @ B2 ) ) ) ).
% add_le_cancel_right
thf(fact_170_union__mset__add__mset__left,axiom,
! [A: $tType,A2: A,A3: multiset @ A,B6: multiset @ A] :
( ( plus_plus @ ( multiset @ A ) @ ( add_mset @ A @ A2 @ A3 ) @ B6 )
= ( add_mset @ A @ A2 @ ( plus_plus @ ( multiset @ A ) @ A3 @ B6 ) ) ) ).
% union_mset_add_mset_left
thf(fact_171_union__mset__add__mset__right,axiom,
! [A: $tType,A3: multiset @ A,A2: A,B6: multiset @ A] :
( ( plus_plus @ ( multiset @ A ) @ A3 @ ( add_mset @ A @ A2 @ B6 ) )
= ( add_mset @ A @ A2 @ ( plus_plus @ ( multiset @ A ) @ A3 @ B6 ) ) ) ).
% union_mset_add_mset_right
thf(fact_172_zero__le__double__add__iff__zero__le__single__add,axiom,
! [A: $tType] :
( ( linord219039673up_add @ A )
=> ! [A2: A] :
( ( ord_less_eq @ A @ ( zero_zero @ A ) @ ( plus_plus @ A @ A2 @ A2 ) )
= ( ord_less_eq @ A @ ( zero_zero @ A ) @ A2 ) ) ) ).
% zero_le_double_add_iff_zero_le_single_add
thf(fact_173_double__add__le__zero__iff__single__add__le__zero,axiom,
! [A: $tType] :
( ( linord219039673up_add @ A )
=> ! [A2: A] :
( ( ord_less_eq @ A @ ( plus_plus @ A @ A2 @ A2 ) @ ( zero_zero @ A ) )
= ( ord_less_eq @ A @ A2 @ ( zero_zero @ A ) ) ) ) ).
% double_add_le_zero_iff_single_add_le_zero
thf(fact_174_le__add__same__cancel2,axiom,
! [A: $tType] :
( ( ordere516151231imp_le @ A )
=> ! [A2: A,B2: A] :
( ( ord_less_eq @ A @ A2 @ ( plus_plus @ A @ B2 @ A2 ) )
= ( ord_less_eq @ A @ ( zero_zero @ A ) @ B2 ) ) ) ).
% le_add_same_cancel2
thf(fact_175_le__add__same__cancel1,axiom,
! [A: $tType] :
( ( ordere516151231imp_le @ A )
=> ! [A2: A,B2: A] :
( ( ord_less_eq @ A @ A2 @ ( plus_plus @ A @ A2 @ B2 ) )
= ( ord_less_eq @ A @ ( zero_zero @ A ) @ B2 ) ) ) ).
% le_add_same_cancel1
thf(fact_176_add__le__same__cancel2,axiom,
! [A: $tType] :
( ( ordere516151231imp_le @ A )
=> ! [A2: A,B2: A] :
( ( ord_less_eq @ A @ ( plus_plus @ A @ A2 @ B2 ) @ B2 )
= ( ord_less_eq @ A @ A2 @ ( zero_zero @ A ) ) ) ) ).
% add_le_same_cancel2
thf(fact_177_add__le__same__cancel1,axiom,
! [A: $tType] :
( ( ordere516151231imp_le @ A )
=> ! [B2: A,A2: A] :
( ( ord_less_eq @ A @ ( plus_plus @ A @ B2 @ A2 ) @ B2 )
= ( ord_less_eq @ A @ A2 @ ( zero_zero @ A ) ) ) ) ).
% add_le_same_cancel1
thf(fact_178_add__mset__subseteq__single__iff,axiom,
! [A: $tType,A2: A,M4: multiset @ A,B2: A] :
( ( subseteq_mset @ A @ ( add_mset @ A @ A2 @ M4 ) @ ( add_mset @ A @ B2 @ ( zero_zero @ ( multiset @ A ) ) ) )
= ( ( M4
= ( zero_zero @ ( multiset @ A ) ) )
& ( A2 = B2 ) ) ) ).
% add_mset_subseteq_single_iff
thf(fact_179_verit__sum__simplify,axiom,
! [A: $tType] :
( ( cancel1352612707id_add @ A )
=> ! [A2: A] :
( ( plus_plus @ A @ A2 @ ( zero_zero @ A ) )
= A2 ) ) ).
% verit_sum_simplify
thf(fact_180_add__mono__thms__linordered__semiring_I3_J,axiom,
! [A: $tType] :
( ( ordere779506340up_add @ A )
=> ! [I: A,J2: A,K2: A,L: A] :
( ( ( ord_less_eq @ A @ I @ J2 )
& ( K2 = L ) )
=> ( ord_less_eq @ A @ ( plus_plus @ A @ I @ K2 ) @ ( plus_plus @ A @ J2 @ L ) ) ) ) ).
% add_mono_thms_linordered_semiring(3)
thf(fact_181_add__mono__thms__linordered__semiring_I2_J,axiom,
! [A: $tType] :
( ( ordere779506340up_add @ A )
=> ! [I: A,J2: A,K2: A,L: A] :
( ( ( I = J2 )
& ( ord_less_eq @ A @ K2 @ L ) )
=> ( ord_less_eq @ A @ ( plus_plus @ A @ I @ K2 ) @ ( plus_plus @ A @ J2 @ L ) ) ) ) ).
% add_mono_thms_linordered_semiring(2)
thf(fact_182_add__mono__thms__linordered__semiring_I1_J,axiom,
! [A: $tType] :
( ( ordere779506340up_add @ A )
=> ! [I: A,J2: A,K2: A,L: A] :
( ( ( ord_less_eq @ A @ I @ J2 )
& ( ord_less_eq @ A @ K2 @ L ) )
=> ( ord_less_eq @ A @ ( plus_plus @ A @ I @ K2 ) @ ( plus_plus @ A @ J2 @ L ) ) ) ) ).
% add_mono_thms_linordered_semiring(1)
thf(fact_183_add__mono,axiom,
! [A: $tType] :
( ( ordere779506340up_add @ A )
=> ! [A2: A,B2: A,C2: A,D3: A] :
( ( ord_less_eq @ A @ A2 @ B2 )
=> ( ( ord_less_eq @ A @ C2 @ D3 )
=> ( ord_less_eq @ A @ ( plus_plus @ A @ A2 @ C2 ) @ ( plus_plus @ A @ B2 @ D3 ) ) ) ) ) ).
% add_mono
thf(fact_184_add__left__mono,axiom,
! [A: $tType] :
( ( ordere779506340up_add @ A )
=> ! [A2: A,B2: A,C2: A] :
( ( ord_less_eq @ A @ A2 @ B2 )
=> ( ord_less_eq @ A @ ( plus_plus @ A @ C2 @ A2 ) @ ( plus_plus @ A @ C2 @ B2 ) ) ) ) ).
% add_left_mono
thf(fact_185_less__eqE,axiom,
! [A: $tType] :
( ( canoni770627133id_add @ A )
=> ! [A2: A,B2: A] :
( ( ord_less_eq @ A @ A2 @ B2 )
=> ~ ! [C3: A] :
( B2
!= ( plus_plus @ A @ A2 @ C3 ) ) ) ) ).
% less_eqE
thf(fact_186_add__right__mono,axiom,
! [A: $tType] :
( ( ordere779506340up_add @ A )
=> ! [A2: A,B2: A,C2: A] :
( ( ord_less_eq @ A @ A2 @ B2 )
=> ( ord_less_eq @ A @ ( plus_plus @ A @ A2 @ C2 ) @ ( plus_plus @ A @ B2 @ C2 ) ) ) ) ).
% add_right_mono
thf(fact_187_le__iff__add,axiom,
! [A: $tType] :
( ( canoni770627133id_add @ A )
=> ( ( ord_less_eq @ A )
= ( ^ [A4: A,B3: A] :
? [C5: A] :
( B3
= ( plus_plus @ A @ A4 @ C5 ) ) ) ) ) ).
% le_iff_add
thf(fact_188_add__le__imp__le__left,axiom,
! [A: $tType] :
( ( ordere236663937imp_le @ A )
=> ! [C2: A,A2: A,B2: A] :
( ( ord_less_eq @ A @ ( plus_plus @ A @ C2 @ A2 ) @ ( plus_plus @ A @ C2 @ B2 ) )
=> ( ord_less_eq @ A @ A2 @ B2 ) ) ) ).
% add_le_imp_le_left
thf(fact_189_add__le__imp__le__right,axiom,
! [A: $tType] :
( ( ordere236663937imp_le @ A )
=> ! [A2: A,C2: A,B2: A] :
( ( ord_less_eq @ A @ ( plus_plus @ A @ A2 @ C2 ) @ ( plus_plus @ A @ B2 @ C2 ) )
=> ( ord_less_eq @ A @ A2 @ B2 ) ) ) ).
% add_le_imp_le_right
thf(fact_190_union__iff,axiom,
! [A: $tType,A2: A,A3: multiset @ A,B6: multiset @ A] :
( ( member @ A @ A2 @ ( set_mset @ A @ ( plus_plus @ ( multiset @ A ) @ A3 @ B6 ) ) )
= ( ( member @ A @ A2 @ ( set_mset @ A @ A3 ) )
| ( member @ A @ A2 @ ( set_mset @ A @ B6 ) ) ) ) ).
% union_iff
thf(fact_191_mset__subset__eqD,axiom,
! [A: $tType,A3: multiset @ A,B6: multiset @ A,X: A] :
( ( subseteq_mset @ A @ A3 @ B6 )
=> ( ( member @ A @ X @ ( set_mset @ A @ A3 ) )
=> ( member @ A @ X @ ( set_mset @ A @ B6 ) ) ) ) ).
% mset_subset_eqD
thf(fact_192_mset__subset__eq__add__mset__cancel,axiom,
! [A: $tType,A2: A,A3: multiset @ A,B6: multiset @ A] :
( ( subseteq_mset @ A @ ( add_mset @ A @ A2 @ A3 ) @ ( add_mset @ A @ A2 @ B6 ) )
= ( subseteq_mset @ A @ A3 @ B6 ) ) ).
% mset_subset_eq_add_mset_cancel
thf(fact_193_set__mset__mono,axiom,
! [A: $tType,A3: multiset @ A,B6: multiset @ A] :
( ( subseteq_mset @ A @ A3 @ B6 )
=> ( ord_less_eq @ ( set @ A ) @ ( set_mset @ A @ A3 ) @ ( set_mset @ A @ B6 ) ) ) ).
% set_mset_mono
thf(fact_194_add__nonpos__eq__0__iff,axiom,
! [A: $tType] :
( ( ordere216010020id_add @ A )
=> ! [X: A,Y: A] :
( ( ord_less_eq @ A @ X @ ( zero_zero @ A ) )
=> ( ( ord_less_eq @ A @ Y @ ( zero_zero @ A ) )
=> ( ( ( plus_plus @ A @ X @ Y )
= ( zero_zero @ A ) )
= ( ( X
= ( zero_zero @ A ) )
& ( Y
= ( zero_zero @ A ) ) ) ) ) ) ) ).
% add_nonpos_eq_0_iff
thf(fact_195_add__nonneg__eq__0__iff,axiom,
! [A: $tType] :
( ( ordere216010020id_add @ A )
=> ! [X: A,Y: A] :
( ( ord_less_eq @ A @ ( zero_zero @ A ) @ X )
=> ( ( ord_less_eq @ A @ ( zero_zero @ A ) @ Y )
=> ( ( ( plus_plus @ A @ X @ Y )
= ( zero_zero @ A ) )
= ( ( X
= ( zero_zero @ A ) )
& ( Y
= ( zero_zero @ A ) ) ) ) ) ) ) ).
% add_nonneg_eq_0_iff
thf(fact_196_add__nonpos__nonpos,axiom,
! [A: $tType] :
( ( ordere216010020id_add @ A )
=> ! [A2: A,B2: A] :
( ( ord_less_eq @ A @ A2 @ ( zero_zero @ A ) )
=> ( ( ord_less_eq @ A @ B2 @ ( zero_zero @ A ) )
=> ( ord_less_eq @ A @ ( plus_plus @ A @ A2 @ B2 ) @ ( zero_zero @ A ) ) ) ) ) ).
% add_nonpos_nonpos
thf(fact_197_add__nonneg__nonneg,axiom,
! [A: $tType] :
( ( ordere216010020id_add @ A )
=> ! [A2: A,B2: A] :
( ( ord_less_eq @ A @ ( zero_zero @ A ) @ A2 )
=> ( ( ord_less_eq @ A @ ( zero_zero @ A ) @ B2 )
=> ( ord_less_eq @ A @ ( zero_zero @ A ) @ ( plus_plus @ A @ A2 @ B2 ) ) ) ) ) ).
% add_nonneg_nonneg
thf(fact_198_add__increasing2,axiom,
! [A: $tType] :
( ( ordere216010020id_add @ A )
=> ! [C2: A,B2: A,A2: A] :
( ( ord_less_eq @ A @ ( zero_zero @ A ) @ C2 )
=> ( ( ord_less_eq @ A @ B2 @ A2 )
=> ( ord_less_eq @ A @ B2 @ ( plus_plus @ A @ A2 @ C2 ) ) ) ) ) ).
% add_increasing2
thf(fact_199_add__decreasing2,axiom,
! [A: $tType] :
( ( ordere216010020id_add @ A )
=> ! [C2: A,A2: A,B2: A] :
( ( ord_less_eq @ A @ C2 @ ( zero_zero @ A ) )
=> ( ( ord_less_eq @ A @ A2 @ B2 )
=> ( ord_less_eq @ A @ ( plus_plus @ A @ A2 @ C2 ) @ B2 ) ) ) ) ).
% add_decreasing2
thf(fact_200_add__increasing,axiom,
! [A: $tType] :
( ( ordere216010020id_add @ A )
=> ! [A2: A,B2: A,C2: A] :
( ( ord_less_eq @ A @ ( zero_zero @ A ) @ A2 )
=> ( ( ord_less_eq @ A @ B2 @ C2 )
=> ( ord_less_eq @ A @ B2 @ ( plus_plus @ A @ A2 @ C2 ) ) ) ) ) ).
% add_increasing
thf(fact_201_add__decreasing,axiom,
! [A: $tType] :
( ( ordere216010020id_add @ A )
=> ! [A2: A,C2: A,B2: A] :
( ( ord_less_eq @ A @ A2 @ ( zero_zero @ A ) )
=> ( ( ord_less_eq @ A @ C2 @ B2 )
=> ( ord_less_eq @ A @ ( plus_plus @ A @ A2 @ C2 ) @ B2 ) ) ) ) ).
% add_decreasing
thf(fact_202_single__is__union,axiom,
! [A: $tType,A2: A,M4: multiset @ A,N: multiset @ A] :
( ( ( add_mset @ A @ A2 @ ( zero_zero @ ( multiset @ A ) ) )
= ( plus_plus @ ( multiset @ A ) @ M4 @ N ) )
= ( ( ( ( add_mset @ A @ A2 @ ( zero_zero @ ( multiset @ A ) ) )
= M4 )
& ( N
= ( zero_zero @ ( multiset @ A ) ) ) )
| ( ( M4
= ( zero_zero @ ( multiset @ A ) ) )
& ( ( add_mset @ A @ A2 @ ( zero_zero @ ( multiset @ A ) ) )
= N ) ) ) ) ).
% single_is_union
thf(fact_203_union__is__single,axiom,
! [A: $tType,M4: multiset @ A,N: multiset @ A,A2: A] :
( ( ( plus_plus @ ( multiset @ A ) @ M4 @ N )
= ( add_mset @ A @ A2 @ ( zero_zero @ ( multiset @ A ) ) ) )
= ( ( ( M4
= ( add_mset @ A @ A2 @ ( zero_zero @ ( multiset @ A ) ) ) )
& ( N
= ( zero_zero @ ( multiset @ A ) ) ) )
| ( ( M4
= ( zero_zero @ ( multiset @ A ) ) )
& ( N
= ( add_mset @ A @ A2 @ ( zero_zero @ ( multiset @ A ) ) ) ) ) ) ) ).
% union_is_single
thf(fact_204_add__mset__add__single,axiom,
! [A: $tType] :
( ( add_mset @ A )
= ( ^ [A4: A,A8: multiset @ A] : ( plus_plus @ ( multiset @ A ) @ A8 @ ( add_mset @ A @ A4 @ ( zero_zero @ ( multiset @ A ) ) ) ) ) ) ).
% add_mset_add_single
thf(fact_205_multi__subset__induct,axiom,
! [A: $tType,F5: multiset @ A,A3: multiset @ A,P: ( multiset @ A ) > $o] :
( ( subseteq_mset @ A @ F5 @ A3 )
=> ( ( P @ ( zero_zero @ ( multiset @ A ) ) )
=> ( ! [A5: A,F6: multiset @ A] :
( ( member @ A @ A5 @ ( set_mset @ A @ A3 ) )
=> ( ( P @ F6 )
=> ( P @ ( add_mset @ A @ A5 @ F6 ) ) ) )
=> ( P @ F5 ) ) ) ) ).
% multi_subset_induct
thf(fact_206_mset__subset__eq__single,axiom,
! [A: $tType,A2: A,B6: multiset @ A] :
( ( member @ A @ A2 @ ( set_mset @ A @ B6 ) )
=> ( subseteq_mset @ A @ ( add_mset @ A @ A2 @ ( zero_zero @ ( multiset @ A ) ) ) @ B6 ) ) ).
% mset_subset_eq_single
thf(fact_207_multi__member__skip,axiom,
! [A: $tType,X: A,XS: multiset @ A,Y: A] :
( ( member @ A @ X @ ( set_mset @ A @ XS ) )
=> ( member @ A @ X @ ( set_mset @ A @ ( plus_plus @ ( multiset @ A ) @ ( add_mset @ A @ Y @ ( zero_zero @ ( multiset @ A ) ) ) @ XS ) ) ) ) ).
% multi_member_skip
thf(fact_208_multi__member__this,axiom,
! [A: $tType,X: A,XS: multiset @ A] : ( member @ A @ X @ ( set_mset @ A @ ( plus_plus @ ( multiset @ A ) @ ( add_mset @ A @ X @ ( zero_zero @ ( multiset @ A ) ) ) @ XS ) ) ) ).
% multi_member_this
thf(fact_209_mult1E,axiom,
! [A: $tType,N: multiset @ A,M4: multiset @ A,R: set @ ( product_prod @ A @ A )] :
( ( member @ ( product_prod @ ( multiset @ A ) @ ( multiset @ A ) ) @ ( product_Pair @ ( multiset @ A ) @ ( multiset @ A ) @ N @ M4 ) @ ( mult1 @ A @ R ) )
=> ~ ! [A5: A,M0: multiset @ A] :
( ( M4
= ( add_mset @ A @ A5 @ M0 ) )
=> ! [K3: multiset @ A] :
( ( N
= ( plus_plus @ ( multiset @ A ) @ M0 @ K3 ) )
=> ~ ! [B8: A] :
( ( member @ A @ B8 @ ( set_mset @ A @ K3 ) )
=> ( member @ ( product_prod @ A @ A ) @ ( product_Pair @ A @ A @ B8 @ A5 ) @ R ) ) ) ) ) ).
% mult1E
thf(fact_210_mult1I,axiom,
! [A: $tType,M4: multiset @ A,A2: A,M02: multiset @ A,N: multiset @ A,K4: multiset @ A,R: set @ ( product_prod @ A @ A )] :
( ( M4
= ( add_mset @ A @ A2 @ M02 ) )
=> ( ( N
= ( plus_plus @ ( multiset @ A ) @ M02 @ K4 ) )
=> ( ! [B4: A] :
( ( member @ A @ B4 @ ( set_mset @ A @ K4 ) )
=> ( member @ ( product_prod @ A @ A ) @ ( product_Pair @ A @ A @ B4 @ A2 ) @ R ) )
=> ( member @ ( product_prod @ ( multiset @ A ) @ ( multiset @ A ) ) @ ( product_Pair @ ( multiset @ A ) @ ( multiset @ A ) @ N @ M4 ) @ ( mult1 @ A @ R ) ) ) ) ) ).
% mult1I
thf(fact_211_less__add,axiom,
! [A: $tType,N: multiset @ A,A2: A,M02: multiset @ A,R: set @ ( product_prod @ A @ A )] :
( ( member @ ( product_prod @ ( multiset @ A ) @ ( multiset @ A ) ) @ ( product_Pair @ ( multiset @ A ) @ ( multiset @ A ) @ N @ ( add_mset @ A @ A2 @ M02 ) ) @ ( mult1 @ A @ R ) )
=> ( ? [M5: multiset @ A] :
( ( member @ ( product_prod @ ( multiset @ A ) @ ( multiset @ A ) ) @ ( product_Pair @ ( multiset @ A ) @ ( multiset @ A ) @ M5 @ M02 ) @ ( mult1 @ A @ R ) )
& ( N
= ( add_mset @ A @ A2 @ M5 ) ) )
| ? [K3: multiset @ A] :
( ! [B8: A] :
( ( member @ A @ B8 @ ( set_mset @ A @ K3 ) )
=> ( member @ ( product_prod @ A @ A ) @ ( product_Pair @ A @ A @ B8 @ A2 ) @ R ) )
& ( N
= ( plus_plus @ ( multiset @ A ) @ M02 @ K3 ) ) ) ) ) ).
% less_add
thf(fact_212_mono__mult1,axiom,
! [A: $tType,R: set @ ( product_prod @ A @ A ),R5: set @ ( product_prod @ A @ A )] :
( ( ord_less_eq @ ( set @ ( product_prod @ A @ A ) ) @ R @ R5 )
=> ( ord_less_eq @ ( set @ ( product_prod @ ( multiset @ A ) @ ( multiset @ A ) ) ) @ ( mult1 @ A @ R ) @ ( mult1 @ A @ R5 ) ) ) ).
% mono_mult1
thf(fact_213_subset__antisym,axiom,
! [A: $tType,A3: set @ A,B6: set @ A] :
( ( ord_less_eq @ ( set @ A ) @ A3 @ B6 )
=> ( ( ord_less_eq @ ( set @ A ) @ B6 @ A3 )
=> ( A3 = B6 ) ) ) ).
% subset_antisym
thf(fact_214_subsetI,axiom,
! [A: $tType,A3: set @ A,B6: set @ A] :
( ! [X4: A] :
( ( member @ A @ X4 @ A3 )
=> ( member @ A @ X4 @ B6 ) )
=> ( ord_less_eq @ ( set @ A ) @ A3 @ B6 ) ) ).
% subsetI
thf(fact_215_in__mono,axiom,
! [A: $tType,A3: set @ A,B6: set @ A,X: A] :
( ( ord_less_eq @ ( set @ A ) @ A3 @ B6 )
=> ( ( member @ A @ X @ A3 )
=> ( member @ A @ X @ B6 ) ) ) ).
% in_mono
thf(fact_216_subsetD,axiom,
! [A: $tType,A3: set @ A,B6: set @ A,C2: A] :
( ( ord_less_eq @ ( set @ A ) @ A3 @ B6 )
=> ( ( member @ A @ C2 @ A3 )
=> ( member @ A @ C2 @ B6 ) ) ) ).
% subsetD
thf(fact_217_equalityE,axiom,
! [A: $tType,A3: set @ A,B6: set @ A] :
( ( A3 = B6 )
=> ~ ( ( ord_less_eq @ ( set @ A ) @ A3 @ B6 )
=> ~ ( ord_less_eq @ ( set @ A ) @ B6 @ A3 ) ) ) ).
% equalityE
thf(fact_218_subset__eq,axiom,
! [A: $tType] :
( ( ord_less_eq @ ( set @ A ) )
= ( ^ [A8: set @ A,B9: set @ A] :
! [X5: A] :
( ( member @ A @ X5 @ A8 )
=> ( member @ A @ X5 @ B9 ) ) ) ) ).
% subset_eq
thf(fact_219_equalityD1,axiom,
! [A: $tType,A3: set @ A,B6: set @ A] :
( ( A3 = B6 )
=> ( ord_less_eq @ ( set @ A ) @ A3 @ B6 ) ) ).
% equalityD1
thf(fact_220_equalityD2,axiom,
! [A: $tType,A3: set @ A,B6: set @ A] :
( ( A3 = B6 )
=> ( ord_less_eq @ ( set @ A ) @ B6 @ A3 ) ) ).
% equalityD2
thf(fact_221_subset__iff,axiom,
! [A: $tType] :
( ( ord_less_eq @ ( set @ A ) )
= ( ^ [A8: set @ A,B9: set @ A] :
! [T3: A] :
( ( member @ A @ T3 @ A8 )
=> ( member @ A @ T3 @ B9 ) ) ) ) ).
% subset_iff
thf(fact_222_subset__refl,axiom,
! [A: $tType,A3: set @ A] : ( ord_less_eq @ ( set @ A ) @ A3 @ A3 ) ).
% subset_refl
thf(fact_223_Collect__mono,axiom,
! [A: $tType,P: A > $o,Q: A > $o] :
( ! [X4: A] :
( ( P @ X4 )
=> ( Q @ X4 ) )
=> ( ord_less_eq @ ( set @ A ) @ ( collect @ A @ P ) @ ( collect @ A @ Q ) ) ) ).
% Collect_mono
thf(fact_224_subset__trans,axiom,
! [A: $tType,A3: set @ A,B6: set @ A,C4: set @ A] :
( ( ord_less_eq @ ( set @ A ) @ A3 @ B6 )
=> ( ( ord_less_eq @ ( set @ A ) @ B6 @ C4 )
=> ( ord_less_eq @ ( set @ A ) @ A3 @ C4 ) ) ) ).
% subset_trans
thf(fact_225_set__eq__subset,axiom,
! [A: $tType] :
( ( ^ [Y3: set @ A,Z: set @ A] : Y3 = Z )
= ( ^ [A8: set @ A,B9: set @ A] :
( ( ord_less_eq @ ( set @ A ) @ A8 @ B9 )
& ( ord_less_eq @ ( set @ A ) @ B9 @ A8 ) ) ) ) ).
% set_eq_subset
thf(fact_226_Collect__mono__iff,axiom,
! [A: $tType,P: A > $o,Q: A > $o] :
( ( ord_less_eq @ ( set @ A ) @ ( collect @ A @ P ) @ ( collect @ A @ Q ) )
= ( ! [X5: A] :
( ( P @ X5 )
=> ( Q @ X5 ) ) ) ) ).
% Collect_mono_iff
thf(fact_227_one__step__implies__mult,axiom,
! [A: $tType,J3: multiset @ A,K4: multiset @ A,R: set @ ( product_prod @ A @ A ),I4: multiset @ A] :
( ( J3
!= ( zero_zero @ ( multiset @ A ) ) )
=> ( ! [X4: A] :
( ( member @ A @ X4 @ ( set_mset @ A @ K4 ) )
=> ? [Xa: A] :
( ( member @ A @ Xa @ ( set_mset @ A @ J3 ) )
& ( member @ ( product_prod @ A @ A ) @ ( product_Pair @ A @ A @ X4 @ Xa ) @ R ) ) )
=> ( member @ ( product_prod @ ( multiset @ A ) @ ( multiset @ A ) ) @ ( product_Pair @ ( multiset @ A ) @ ( multiset @ A ) @ ( plus_plus @ ( multiset @ A ) @ I4 @ K4 ) @ ( plus_plus @ ( multiset @ A ) @ I4 @ J3 ) ) @ ( mult @ A @ R ) ) ) ) ).
% one_step_implies_mult
thf(fact_228_subrelI,axiom,
! [B: $tType,A: $tType,R: set @ ( product_prod @ A @ B ),S: set @ ( product_prod @ A @ B )] :
( ! [X4: A,Y2: B] :
( ( member @ ( product_prod @ A @ B ) @ ( product_Pair @ A @ B @ X4 @ Y2 ) @ R )
=> ( member @ ( product_prod @ A @ B ) @ ( product_Pair @ A @ B @ X4 @ Y2 ) @ S ) )
=> ( ord_less_eq @ ( set @ ( product_prod @ A @ B ) ) @ R @ S ) ) ).
% subrelI
thf(fact_229_mono__mult,axiom,
! [A: $tType,R: set @ ( product_prod @ A @ A ),R5: set @ ( product_prod @ A @ A )] :
( ( ord_less_eq @ ( set @ ( product_prod @ A @ A ) ) @ R @ R5 )
=> ( ord_less_eq @ ( set @ ( product_prod @ ( multiset @ A ) @ ( multiset @ A ) ) ) @ ( mult @ A @ R ) @ ( mult @ A @ R5 ) ) ) ).
% mono_mult
thf(fact_230_mult__implies__one__step,axiom,
! [A: $tType,R: set @ ( product_prod @ A @ A ),M4: multiset @ A,N: multiset @ A] :
( ( trans @ A @ R )
=> ( ( member @ ( product_prod @ ( multiset @ A ) @ ( multiset @ A ) ) @ ( product_Pair @ ( multiset @ A ) @ ( multiset @ A ) @ M4 @ N ) @ ( mult @ A @ R ) )
=> ? [I5: multiset @ A,J4: multiset @ A] :
( ( N
= ( plus_plus @ ( multiset @ A ) @ I5 @ J4 ) )
& ? [K3: multiset @ A] :
( ( M4
= ( plus_plus @ ( multiset @ A ) @ I5 @ K3 ) )
& ( J4
!= ( zero_zero @ ( multiset @ A ) ) )
& ! [X7: A] :
( ( member @ A @ X7 @ ( set_mset @ A @ K3 ) )
=> ? [Xa2: A] :
( ( member @ A @ Xa2 @ ( set_mset @ A @ J4 ) )
& ( member @ ( product_prod @ A @ A ) @ ( product_Pair @ A @ A @ X7 @ Xa2 ) @ R ) ) ) ) ) ) ) ).
% mult_implies_one_step
thf(fact_231_subset__mset_Osum__mset__0__iff,axiom,
! [A: $tType,M4: multiset @ ( multiset @ A )] :
( ( ( comm_monoid_sum_mset @ ( multiset @ A ) @ ( plus_plus @ ( multiset @ A ) ) @ ( zero_zero @ ( multiset @ A ) ) @ M4 )
= ( zero_zero @ ( multiset @ A ) ) )
= ( ! [X5: multiset @ A] :
( ( member @ ( multiset @ A ) @ X5 @ ( set_mset @ ( multiset @ A ) @ M4 ) )
=> ( X5
= ( zero_zero @ ( multiset @ A ) ) ) ) ) ) ).
% subset_mset.sum_mset_0_iff
thf(fact_232_transD,axiom,
! [A: $tType,R: set @ ( product_prod @ A @ A ),X: A,Y: A,Z2: A] :
( ( trans @ A @ R )
=> ( ( member @ ( product_prod @ A @ A ) @ ( product_Pair @ A @ A @ X @ Y ) @ R )
=> ( ( member @ ( product_prod @ A @ A ) @ ( product_Pair @ A @ A @ Y @ Z2 ) @ R )
=> ( member @ ( product_prod @ A @ A ) @ ( product_Pair @ A @ A @ X @ Z2 ) @ R ) ) ) ) ).
% transD
thf(fact_233_transE,axiom,
! [A: $tType,R: set @ ( product_prod @ A @ A ),X: A,Y: A,Z2: A] :
( ( trans @ A @ R )
=> ( ( member @ ( product_prod @ A @ A ) @ ( product_Pair @ A @ A @ X @ Y ) @ R )
=> ( ( member @ ( product_prod @ A @ A ) @ ( product_Pair @ A @ A @ Y @ Z2 ) @ R )
=> ( member @ ( product_prod @ A @ A ) @ ( product_Pair @ A @ A @ X @ Z2 ) @ R ) ) ) ) ).
% transE
thf(fact_234_transI,axiom,
! [A: $tType,R: set @ ( product_prod @ A @ A )] :
( ! [X4: A,Y2: A,Z3: A] :
( ( member @ ( product_prod @ A @ A ) @ ( product_Pair @ A @ A @ X4 @ Y2 ) @ R )
=> ( ( member @ ( product_prod @ A @ A ) @ ( product_Pair @ A @ A @ Y2 @ Z3 ) @ R )
=> ( member @ ( product_prod @ A @ A ) @ ( product_Pair @ A @ A @ X4 @ Z3 ) @ R ) ) )
=> ( trans @ A @ R ) ) ).
% transI
thf(fact_235_trans__def,axiom,
! [A: $tType] :
( ( trans @ A )
= ( ^ [R4: set @ ( product_prod @ A @ A )] :
! [X5: A,Y4: A,Z4: A] :
( ( member @ ( product_prod @ A @ A ) @ ( product_Pair @ A @ A @ X5 @ Y4 ) @ R4 )
=> ( ( member @ ( product_prod @ A @ A ) @ ( product_Pair @ A @ A @ Y4 @ Z4 ) @ R4 )
=> ( member @ ( product_prod @ A @ A ) @ ( product_Pair @ A @ A @ X5 @ Z4 ) @ R4 ) ) ) ) ) ).
% trans_def
thf(fact_236_mult__cancel__add__mset,axiom,
! [A: $tType,S: set @ ( product_prod @ A @ A ),Uu: A,X8: multiset @ A,Y7: multiset @ A] :
( ( trans @ A @ S )
=> ( ( irrefl @ A @ S )
=> ( ( member @ ( product_prod @ ( multiset @ A ) @ ( multiset @ A ) ) @ ( product_Pair @ ( multiset @ A ) @ ( multiset @ A ) @ ( add_mset @ A @ Uu @ X8 ) @ ( add_mset @ A @ Uu @ Y7 ) ) @ ( mult @ A @ S ) )
= ( member @ ( product_prod @ ( multiset @ A ) @ ( multiset @ A ) ) @ ( product_Pair @ ( multiset @ A ) @ ( multiset @ A ) @ X8 @ Y7 ) @ ( mult @ A @ S ) ) ) ) ) ).
% mult_cancel_add_mset
thf(fact_237_in__mset__fold__plus__iff,axiom,
! [A: $tType,X: A,M4: multiset @ A,NN: multiset @ ( multiset @ A )] :
( ( member @ A @ X @ ( set_mset @ A @ ( fold_mset @ ( multiset @ A ) @ ( multiset @ A ) @ ( plus_plus @ ( multiset @ A ) ) @ M4 @ NN ) ) )
= ( ( member @ A @ X @ ( set_mset @ A @ M4 ) )
| ? [N4: multiset @ A] :
( ( member @ ( multiset @ A ) @ N4 @ ( set_mset @ ( multiset @ A ) @ NN ) )
& ( member @ A @ X @ ( set_mset @ A @ N4 ) ) ) ) ) ).
% in_mset_fold_plus_iff
thf(fact_238_irrefl__def,axiom,
! [A: $tType] :
( ( irrefl @ A )
= ( ^ [R4: set @ ( product_prod @ A @ A )] :
! [A4: A] :
~ ( member @ ( product_prod @ A @ A ) @ ( product_Pair @ A @ A @ A4 @ A4 ) @ R4 ) ) ) ).
% irrefl_def
thf(fact_239_irreflI,axiom,
! [A: $tType,R3: set @ ( product_prod @ A @ A )] :
( ! [A5: A] :
~ ( member @ ( product_prod @ A @ A ) @ ( product_Pair @ A @ A @ A5 @ A5 ) @ R3 )
=> ( irrefl @ A @ R3 ) ) ).
% irreflI
thf(fact_240_union__fold__mset__add__mset,axiom,
! [A: $tType] :
( ( plus_plus @ ( multiset @ A ) )
= ( fold_mset @ A @ ( multiset @ A ) @ ( add_mset @ A ) ) ) ).
% union_fold_mset_add_mset
thf(fact_241_multp__iff,axiom,
! [A: $tType,R3: set @ ( product_prod @ A @ A ),P: A > A > $o,N: multiset @ A,M4: multiset @ A] :
( ( irrefl @ A @ R3 )
=> ( ( trans @ A @ R3 )
=> ( ! [X4: A,Y2: A] :
( ( P @ X4 @ Y2 )
= ( member @ ( product_prod @ A @ A ) @ ( product_Pair @ A @ A @ X4 @ Y2 ) @ R3 ) )
=> ( ( multp @ A @ P @ N @ M4 )
= ( member @ ( product_prod @ ( multiset @ A ) @ ( multiset @ A ) ) @ ( product_Pair @ ( multiset @ A ) @ ( multiset @ A ) @ N @ M4 ) @ ( mult @ A @ R3 ) ) ) ) ) ) ).
% multp_iff
thf(fact_242_add__mset__replicate__mset__safe,axiom,
! [A: $tType,B: $tType,M4: multiset @ B,A2: B] :
( ( nO_MATCH @ ( multiset @ A ) @ ( multiset @ B ) @ ( zero_zero @ ( multiset @ A ) ) @ M4 )
=> ( ( add_mset @ B @ A2 @ M4 )
= ( plus_plus @ ( multiset @ B ) @ ( add_mset @ B @ A2 @ ( zero_zero @ ( multiset @ B ) ) ) @ M4 ) ) ) ).
% add_mset_replicate_mset_safe
thf(fact_243_subset__mset_Osum__mset__mono,axiom,
! [A: $tType,B: $tType,K4: multiset @ B,F: B > ( multiset @ A ),G: B > ( multiset @ A )] :
( ! [I3: B] :
( ( member @ B @ I3 @ ( set_mset @ B @ K4 ) )
=> ( subseteq_mset @ A @ ( F @ I3 ) @ ( G @ I3 ) ) )
=> ( subseteq_mset @ A @ ( comm_monoid_sum_mset @ ( multiset @ A ) @ ( plus_plus @ ( multiset @ A ) ) @ ( zero_zero @ ( multiset @ A ) ) @ ( image_mset @ B @ ( multiset @ A ) @ F @ K4 ) ) @ ( comm_monoid_sum_mset @ ( multiset @ A ) @ ( plus_plus @ ( multiset @ A ) ) @ ( zero_zero @ ( multiset @ A ) ) @ ( image_mset @ B @ ( multiset @ A ) @ G @ K4 ) ) ) ) ).
% subset_mset.sum_mset_mono
thf(fact_244_subset__mset_Oantimono__def,axiom,
! [B: $tType,A: $tType] :
( ( order @ B )
=> ! [F: ( multiset @ A ) > B] :
( ( antimono @ ( multiset @ A ) @ B @ ( subseteq_mset @ A ) @ F )
= ( ! [X5: multiset @ A,Y4: multiset @ A] :
( ( subseteq_mset @ A @ X5 @ Y4 )
=> ( ord_less_eq @ B @ ( F @ Y4 ) @ ( F @ X5 ) ) ) ) ) ) ).
% subset_mset.antimono_def
thf(fact_245_image__mset__add__mset,axiom,
! [A: $tType,B: $tType,F: B > A,A2: B,M4: multiset @ B] :
( ( image_mset @ B @ A @ F @ ( add_mset @ B @ A2 @ M4 ) )
= ( add_mset @ A @ ( F @ A2 ) @ ( image_mset @ B @ A @ F @ M4 ) ) ) ).
% image_mset_add_mset
thf(fact_246_multiset_Omap__cong,axiom,
! [B: $tType,A: $tType,X: multiset @ A,Ya: multiset @ A,F: A > B,G: A > B] :
( ( X = Ya )
=> ( ! [Z3: A] :
( ( member @ A @ Z3 @ ( set_mset @ A @ Ya ) )
=> ( ( F @ Z3 )
= ( G @ Z3 ) ) )
=> ( ( image_mset @ A @ B @ F @ X )
= ( image_mset @ A @ B @ G @ Ya ) ) ) ) ).
% multiset.map_cong
thf(fact_247_multiset_Omap__cong0,axiom,
! [B: $tType,A: $tType,X: multiset @ A,F: A > B,G: A > B] :
( ! [Z3: A] :
( ( member @ A @ Z3 @ ( set_mset @ A @ X ) )
=> ( ( F @ Z3 )
= ( G @ Z3 ) ) )
=> ( ( image_mset @ A @ B @ F @ X )
= ( image_mset @ A @ B @ G @ X ) ) ) ).
% multiset.map_cong0
thf(fact_248_multiset_Oinj__map__strong,axiom,
! [B: $tType,A: $tType,X: multiset @ A,Xa3: multiset @ A,F: A > B,Fa: A > B] :
( ! [Z3: A,Za: A] :
( ( member @ A @ Z3 @ ( set_mset @ A @ X ) )
=> ( ( member @ A @ Za @ ( set_mset @ A @ Xa3 ) )
=> ( ( ( F @ Z3 )
= ( Fa @ Za ) )
=> ( Z3 = Za ) ) ) )
=> ( ( ( image_mset @ A @ B @ F @ X )
= ( image_mset @ A @ B @ Fa @ Xa3 ) )
=> ( X = Xa3 ) ) ) ).
% multiset.inj_map_strong
thf(fact_249_order_Oantimono_Ocong,axiom,
! [B: $tType,A: $tType] :
( ( order @ B )
=> ( ( antimono @ A @ B )
= ( antimono @ A @ B ) ) ) ).
% order.antimono.cong
thf(fact_250_msed__map__invR,axiom,
! [B: $tType,A: $tType,F: B > A,M4: multiset @ B,B2: A,N: multiset @ A] :
( ( ( image_mset @ B @ A @ F @ M4 )
= ( add_mset @ A @ B2 @ N ) )
=> ? [M1: multiset @ B,A5: B] :
( ( M4
= ( add_mset @ B @ A5 @ M1 ) )
& ( ( F @ A5 )
= B2 )
& ( ( image_mset @ B @ A @ F @ M1 )
= N ) ) ) ).
% msed_map_invR
thf(fact_251_msed__map__invL,axiom,
! [B: $tType,A: $tType,F: B > A,A2: B,M4: multiset @ B,N: multiset @ A] :
( ( ( image_mset @ B @ A @ F @ ( add_mset @ B @ A2 @ M4 ) )
= N )
=> ? [N1: multiset @ A] :
( ( N
= ( add_mset @ A @ ( F @ A2 ) @ N1 ) )
& ( ( image_mset @ B @ A @ F @ M4 )
= N1 ) ) ) ).
% msed_map_invL
thf(fact_252_image__mset__single,axiom,
! [B: $tType,A: $tType,F: B > A,X: B] :
( ( image_mset @ B @ A @ F @ ( add_mset @ B @ X @ ( zero_zero @ ( multiset @ B ) ) ) )
= ( add_mset @ A @ ( F @ X ) @ ( zero_zero @ ( multiset @ A ) ) ) ) ).
% image_mset_single
thf(fact_253_subset__mset_OantimonoD,axiom,
! [B: $tType,A: $tType] :
( ( order @ B )
=> ! [F: ( multiset @ A ) > B,X: multiset @ A,Y: multiset @ A] :
( ( antimono @ ( multiset @ A ) @ B @ ( subseteq_mset @ A ) @ F )
=> ( ( subseteq_mset @ A @ X @ Y )
=> ( ord_less_eq @ B @ ( F @ Y ) @ ( F @ X ) ) ) ) ) ).
% subset_mset.antimonoD
thf(fact_254_subset__mset_OantimonoE,axiom,
! [B: $tType,A: $tType] :
( ( order @ B )
=> ! [F: ( multiset @ A ) > B,X: multiset @ A,Y: multiset @ A] :
( ( antimono @ ( multiset @ A ) @ B @ ( subseteq_mset @ A ) @ F )
=> ( ( subseteq_mset @ A @ X @ Y )
=> ( ord_less_eq @ B @ ( F @ Y ) @ ( F @ X ) ) ) ) ) ).
% subset_mset.antimonoE
thf(fact_255_subset__mset_OantimonoI,axiom,
! [B: $tType,A: $tType] :
( ( order @ B )
=> ! [F: ( multiset @ A ) > B] :
( ! [X4: multiset @ A,Y2: multiset @ A] :
( ( subseteq_mset @ A @ X4 @ Y2 )
=> ( ord_less_eq @ B @ ( F @ Y2 ) @ ( F @ X4 ) ) )
=> ( antimono @ ( multiset @ A ) @ B @ ( subseteq_mset @ A ) @ F ) ) ) ).
% subset_mset.antimonoI
% Subclasses (4)
thf(subcl_Orderings_Olinorder___HOL_Otype,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ( type @ A ) ) ).
thf(subcl_Orderings_Olinorder___Orderings_Oord,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ( ord @ A ) ) ).
thf(subcl_Orderings_Olinorder___Orderings_Oorder,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ( order @ A ) ) ).
thf(subcl_Orderings_Olinorder___Orderings_Opreorder,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ( preorder @ A ) ) ).
% Type constructors (15)
thf(tcon_fun___Orderings_Opreorder,axiom,
! [A9: $tType,A10: $tType] :
( ( preorder @ A10 )
=> ( preorder @ ( A9 > A10 ) ) ) ).
thf(tcon_fun___Orderings_Oorder,axiom,
! [A9: $tType,A10: $tType] :
( ( order @ A10 )
=> ( order @ ( A9 > A10 ) ) ) ).
thf(tcon_fun___Orderings_Oord,axiom,
! [A9: $tType,A10: $tType] :
( ( ord @ A10 )
=> ( ord @ ( A9 > A10 ) ) ) ).
thf(tcon_Set_Oset___Orderings_Opreorder_1,axiom,
! [A9: $tType] : ( preorder @ ( set @ A9 ) ) ).
thf(tcon_Set_Oset___Orderings_Oorder_2,axiom,
! [A9: $tType] : ( order @ ( set @ A9 ) ) ).
thf(tcon_Set_Oset___Orderings_Oord_3,axiom,
! [A9: $tType] : ( ord @ ( set @ A9 ) ) ).
thf(tcon_HOL_Obool___Orderings_Opreorder_4,axiom,
preorder @ $o ).
thf(tcon_HOL_Obool___Orderings_Olinorder,axiom,
linorder @ $o ).
thf(tcon_HOL_Obool___Orderings_Oorder_5,axiom,
order @ $o ).
thf(tcon_HOL_Obool___Orderings_Oord_6,axiom,
ord @ $o ).
thf(tcon_Multiset_Omultiset___Groups_Oordered__ab__semigroup__add,axiom,
! [A9: $tType] :
( ( preorder @ A9 )
=> ( ordere779506340up_add @ ( multiset @ A9 ) ) ) ).
thf(tcon_Multiset_Omultiset___Groups_Ocancel__comm__monoid__add,axiom,
! [A9: $tType] : ( cancel1352612707id_add @ ( multiset @ A9 ) ) ).
thf(tcon_Multiset_Omultiset___Orderings_Opreorder_7,axiom,
! [A9: $tType] :
( ( preorder @ A9 )
=> ( preorder @ ( multiset @ A9 ) ) ) ).
thf(tcon_Multiset_Omultiset___Orderings_Oorder_8,axiom,
! [A9: $tType] :
( ( preorder @ A9 )
=> ( order @ ( multiset @ A9 ) ) ) ).
thf(tcon_Multiset_Omultiset___Orderings_Oord_9,axiom,
! [A9: $tType] :
( ( preorder @ A9 )
=> ( ord @ ( multiset @ A9 ) ) ) ).
% Free types (1)
thf(tfree_0,hypothesis,
linorder @ a ).
% Conjectures (1)
thf(conj_0,conjecture,
is_heap @ a @ ( heapIm748920189ftDown @ a @ ( t @ a @ v2 @ ( e @ a ) @ ( t @ a @ v1 @ l1 @ r1 ) ) ) ).
%------------------------------------------------------------------------------